{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:08Z","timestamp":1740107108358,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00373-021-02435-1","type":"journal-article","created":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T14:11:40Z","timestamp":1640009500000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Proper Arc Labeling of Directed Graphs"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1543-1124","authenticated-orcid":false,"given":"Ali","family":"Dehghan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Ahadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"issue":"19\u201321","key":"2435_CR1","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ipl.2013.07.017","volume":"113","author":"A Ahadi","year":"2013","unstructured":"Ahadi, A., Dehghan, A.: The complexity of the proper orientation number. Inf. Process. Lett. 113(19\u201321), 799\u2013803 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2435_CR2","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/s10878-016-0107-8","volume":"34","author":"A Ahadi","year":"2017","unstructured":"Ahadi, A., Dehghan, A., Saghafian, M.: Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34(3), 760\u2013770 (2017)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"2435_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/jgt.22565","volume":"95","author":"J Ai","year":"2020","unstructured":"Ai, J., Gerke, S., Gutin, G., Shi, Y., Taoqiu, Z.: Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory 95(2), 256\u2013266 (2020)","journal-title":"J. Graph Theory"},{"key":"2435_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2021.07.031","volume":"888","author":"J Araujo","year":"2021","unstructured":"Araujo, J., Cezar, A., Lima, C.V.G.C., dos Santos, V.F., Silva, A.: On the proper orientation number of chordal graphs. Theor. Comput. Sci. 888, 117\u2013132 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2435_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2014.11.037","volume":"566","author":"J Araujo","year":"2015","unstructured":"Araujo, J., Cohen, N., de Rezende, S.F., Havet, F., Moura, P.F.S.: On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566, 59\u201375 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"2435_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2016.05.016","volume":"639","author":"J Araujo","year":"2016","unstructured":"Araujo, J., Havet, F., Linhares Sales, C., Silva, A.: Proper orientation of cacti. Theor. Comput. Sci. 639, 14\u201325 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"2435_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2018.11.013","volume":"771","author":"J Ara\u00fajo","year":"2019","unstructured":"Ara\u00fajo, J., Sales, C.L., Sau, I., Silva, A.: Weighted proper orientations of trees and graphs of bounded treewidth. Theor. Comput. Sci. 771, 39\u201348 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"2435_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.dam.2021.06.015","volume":"302","author":"A Dehghan","year":"2021","unstructured":"Dehghan, A.: On the in-out-proper orientations of graphs. Discrete Appl. Math. 302, 129\u2013138 (2021)","journal-title":"Discrete Appl. Math."},{"key":"2435_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.dam.2020.07.003","volume":"296","author":"A Dehghan","year":"2021","unstructured":"Dehghan, A., Havet, F.: On the semi-proper orientations of graphs. Discrete Appl. Math. 296, 9\u201325 (2021)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"2435_CR10","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s00373-014-1446-9","volume":"31","author":"A Dehghan","year":"2015","unstructured":"Dehghan, A., Sadeghi, M.-R., Ahadi, A.: On the complexity of deciding whether the regular number is at most two. Graphs Combin. 31(5), 1359\u20131365 (2015)","journal-title":"Graphs Combin."},{"key":"2435_CR11","volume-title":"Introduction to Computational Complexity","author":"D-Z Du","year":"2002","unstructured":"Du, D.-Z., Ko, K.-K., Wang, J.: Introduction to Computational Complexity. Higher Education Press, Beijing (2002)"},{"key":"2435_CR12","first-page":"125723","volume":"392","author":"R Gu","year":"2021","unstructured":"Gu, R., Lei, H., Ma, Y., Taoqiu, Z.: Note on (semi-)proper orientation of some triangulated planar graphs. Appl. Math. Comput. 392, 125723 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"5","key":"2435_CR13","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s00373-017-1836-x","volume":"33","author":"F Knox","year":"2017","unstructured":"Knox, F., Matsumoto, N., Hermosillo de la Maza, S.G., Mohar, B., Linhares Sales, C.: Proper orientations of planar bipartite graphs. Graphs Comb. 33(5), 1189\u20131194 (2017)","journal-title":"Graphs Comb."},{"key":"2435_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2019.10.009","volume":"279","author":"K Noguchi","year":"2020","unstructured":"Noguchi, K.: Proper 3-orientations of bipartite planar graphs with minimum degree at least 3. Discrete Appl. Math. 279, 195\u2013197 (2020)","journal-title":"Discrete Appl. Math."},{"key":"2435_CR15","volume-title":"Introduction to Graph Theory","author":"DB West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02435-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02435-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02435-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T17:06:05Z","timestamp":1646759165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02435-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["2435"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02435-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,12,15]]},"assertion":[{"value":"6 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1"}}