{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:49:19Z","timestamp":1760298559593},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1202-y","type":"journal-article","created":{"date-parts":[[2012,7,17]],"date-time":"2012-07-17T15:43:39Z","timestamp":1342539819000},"page":"1489-1499","source":"Crossref","is-referenced-by-count":11,"title":["Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth"],"prefix":"10.1007","volume":"29","author":[{"given":"T. H.","family":"Marshall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"key":"1202_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.20233","volume":"55","author":"T.H. Marshall","year":"2007","unstructured":"Marshall T.H.: Homomorphism bounds for oriented planar graphs. J. Graph Theory 55, 175\u2013190 (2007)","journal-title":"J. Graph Theory"},{"key":"1202_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(94)00088-3","volume":"51","author":"A. Raspaud","year":"1994","unstructured":"Raspaud A., Sopena E.: Good and semi-strong colorings of oriented planar graphs. Inform. Proc. Lett. 51, 171\u2013174 (1994)","journal-title":"Inform. Proc. Lett."},{"key":"1202_CR3","unstructured":"Marshall, T.H.: On oriented graphs with certain extension properties. Ars Combinatoria (2012, in press)"},{"key":"1202_CR4","unstructured":"Borodin, Ivanova, A.O.: An oriented 7-coloring of planar graphs with girth at least 7. Sib. Electron. Math. Rep. 2, 222\u2013229 (2005)"},{"issue":"1","key":"1202_CR5","first-page":"16","volume":"13","author":"O.V. Borodin","year":"2006","unstructured":"Borodin O.V., Ivanova A.O., Kostochka A.V.: Oriented 5-coloring of vertices in sparse graphs. (Russian) Diskretn. Anal. Issled. Oper. Ser. 1 13(1), 16\u201332 (2006)","journal-title":"Anal. Issled. Oper. Ser. 1"},{"key":"1202_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0012-365X(98)00393-8","volume":"206","author":"O.V. Borodin","year":"1999","unstructured":"Borodin O.V., Kostochka A.V., Ne\u0161et\u0159il J., Raspaud A., Sopena E.: On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206, 77\u201390 (1999)","journal-title":"Discret. Math."},{"key":"1202_CR7","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Raspaud, A., Sopena, E.: Colorings and girth of oriented planar graphs. Discret. Math. 165\u2013166, 519\u2013530 (1997)","DOI":"10.1016\/S0012-365X(96)00198-7"},{"key":"1202_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ipl.2004.06.012","volume":"92","author":"P. Ochem","year":"2004","unstructured":"Ochem P.: Oriented colorings of triangle-free planar graphs. Inform. Process. Lett. 92, 71\u201376 (2004)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"1202_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ipl.2008.04.007","volume":"108","author":"P. Ochem","year":"2008","unstructured":"Ochem P., Pinlou A.: Oriented colorings of partial 2-trees. Inform. Process. Lett. 108(2), 82\u201386 (2008)","journal-title":"Inform. Process. Lett."},{"key":"1202_CR10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.endm.2011.05.022","volume":"37","author":"P. Ochem","year":"2011","unstructured":"Ochem P., Pinlou A.: Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Elect. Notes Discret. Math. 37, 123\u2013128 (2011)","journal-title":"Elect. Notes Discret. Math."},{"key":"1202_CR11","doi-asserted-by":"crossref","first-page":"2108","DOI":"10.1016\/j.disc.2008.04.030","volume":"309","author":"A. Pinlou","year":"2009","unstructured":"Pinlou A.: An oriented coloring of planar graphs with girth at least five. Discret. Math. 309, 2108\u20132118 (2009)","journal-title":"Discret. Math."},{"key":"1202_CR12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"Thomassen C.: Every planar graph is 5-choosable. J. Combin. Theory Ser. B 62, 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1202_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0095-8956(03)00029-7","volume":"88","author":"C. Thomassen","year":"2003","unstructured":"Thomassen C.: A short list color proof of Gr\u00f6tzsch\u2019s theorem. J. Combin. Theory Ser. B 88(1), 189\u2013192 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1202_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0020-0190(01)00246-0","volume":"81","author":"E. Sopena","year":"2002","unstructured":"Sopena E.: There exist oriented planar graphs with oriented chromatic number at least sixteen. Inform. Proc. Lett. 81, 309\u2013312 (2002)","journal-title":"Inform. Proc. Lett."},{"key":"1202_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ipl.2006.06.012","volume":"100","author":"A. Pinlou","year":"2006","unstructured":"Pinlou A., Sopena E.: Oriented vertex and arc colorings of outerplanar graphs. Inform. Proc. Lett. 100, 97\u2013104 (2006)","journal-title":"Inform. Proc. Lett."},{"key":"1202_CR16","doi-asserted-by":"crossref","unstructured":"Marshall, T.H.: Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth. KAM Dimatia, Czech Republic (2011, preprint)","DOI":"10.1007\/s00373-012-1202-y"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1202-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1202-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1202-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T02:46:19Z","timestamp":1561949179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1202-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1202"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1202-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}