{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:05:49Z","timestamp":1766268349646,"version":"3.37.3"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T00:00:00Z","timestamp":1501632000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009059","name":"Pacific Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARRS (Slovenia)","award":["P10297"],"award-info":[{"award-number":["P10297"]}]},{"name":"CAPES (Brazil)","award":["99999.000458\/2015-05"],"award-info":[{"award-number":["99999.000458\/2015-05"]}]},{"DOI":"10.13039\/501100002784","name":"Canada Excellence Research Chairs, Government of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002784","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00373-017-1836-x","type":"journal-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T02:50:24Z","timestamp":1501642224000},"page":"1189-1194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Proper Orientations of Planar Bipartite Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Fiachra","family":"Knox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7998-6455","authenticated-orcid":false,"given":"Sebasti\u00e1n Gonz\u00e1lez Hermosillo","family":"de\u00a0la Maza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e1udia Linhares","family":"Sales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"key":"1836_CR1","doi-asserted-by":"crossref","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, 799\u2013803 (2013)","journal-title":"Inf. Process. Lett."},{"key":"1836_CR2","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.tcs.2014.11.037","volume":"566","author":"C Araujo","year":"2015","unstructured":"Araujo, C., Cohen, N., de Rezende, S.F., Havet, F., Moura, P.F.S.: On the proper orientation number of bipartite graphs. Theoret. Comput. Sci. 566, 799\u2013803 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1836_CR3","doi-asserted-by":"crossref","unstructured":"Araujo, J., Havet, F., Linhares\u00a0Sales, C., Silva, A.: On the proper orientation number of cacti. Accepted by Theoretical Computer Science (2016)","DOI":"10.1016\/j.tcs.2016.05.016"},{"key":"1836_CR4","doi-asserted-by":"crossref","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","volume":"18","author":"DW Barnette","year":"1966","unstructured":"Barnette, D.W.: Trees in polyhedral graphs. Can. J. Math. 18, 731\u2013736 (1966)","journal-title":"Can. J. Math."},{"key":"1836_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L.: On the degree of the vertices of a directed graph. J. Franklin Inst. 279, 290\u2013308 (1965)","journal-title":"J. Franklin Inst."},{"key":"1836_CR6","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.disc.2008.01.002","volume":"309","author":"A Nakamoto","year":"2009","unstructured":"Nakamoto, A., Oda, Y., Ota, K.: $$3$$ 3 -trees with few vertices of degree $$3$$ 3 in circuit graphs. Discret. Math. 309, 666\u2013672 (2009)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1836-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1836-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1836-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T19:10:22Z","timestamp":1569957022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1836-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,2]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1836"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1836-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,8,2]]}}}