{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:57Z","timestamp":1770972477370,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00276-8","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"73-85","source":"Crossref","is-referenced-by-count":14,"title":["On universal graphs for planar oriented graphs of a given girth"],"prefix":"10.1016","volume":"188","author":[{"given":"O.V.","family":"Borodin","sequence":"first","affiliation":[]},{"given":"A.V.","family":"Kostochka","sequence":"additional","affiliation":[]},{"given":"J.","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[]},{"given":"A.","family":"Raspaud","sequence":"additional","affiliation":[]},{"given":"E.","family":"Sopena","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00276-8_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1994"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0012-365X(98)00393-8","article-title":"On the maximum average degree and the oriented chromatic number of a graph","author":"Borodin","year":"1996"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/eujc.1993.1004","article-title":"On A-mote universal graphs","volume":"13","author":"H\u00e4ggkvist","year":"1993","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0012-365X(97)00276-8_BIB4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB5","first-page":"271","article-title":"Duality of graph homomorphisms","volume":"Vol. 2","author":"Hell","year":"1996"},{"issue":"4","key":"10.1016\/S0012-365X(97)00276-8_BIB6","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1090\/S0002-9947-96-01537-1","article-title":"Duality and polynomial testing of tree homomorphisms","volume":"348","author":"Hell","year":"1996","journal-title":"Trans. AMS"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB7","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"issue":"4","key":"10.1016\/S0012-365X(97)00276-8_BIB8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P","article-title":"Acyclic and oriented chromatic numbers of graphs","volume":"24","author":"Kostochka","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/S0012-365X(96)00198-7","article-title":"Colorings and girth of oriented planar graphs","volume":"165\u2013166","author":"Ne\u0161et\u0159il","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00276-8_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<151::AID-JGT6>3.0.CO;2-S","article-title":"On bounded treewidth duality of graph homomorphisms","volume":"23","author":"Ne\u0161et\u0159il","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00276-8_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(94)00088-3","article-title":"Good and semi-strong colorings of oriented planar graphs","volume":"51","author":"Raspaud","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0012-365X(97)00276-8_BIB12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G","article-title":"The chromatic number of oriented graphs","volume":"25","author":"Sopena","year":"1997","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002768?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002768?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:58Z","timestamp":1556169658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002768"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00276-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}