{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:26Z","timestamp":1725540686280},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_16","type":"book-chapter","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T23:32:11Z","timestamp":1356046331000},"page":"130-142","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Order of a Planar Oclique Is 15"],"prefix":"10.1007","author":[{"given":"Sagnik","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0012-365X(00)00216-8","volume":"229","author":"E. Sopena","year":"2001","unstructured":"Sopena, E.: Oriented graph coloring. Discrete Mathematics\u00a0229(1-3), 359\u2013369 (2001)","journal-title":"Discrete Mathematics"},{"key":"16_CR2","doi-asserted-by":"publisher","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\u00a055, 175\u2013190 (2007)","journal-title":"J. Graph Theory"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","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. Inf. Process. Lett.\u00a051(4), 171\u2013174 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"16_CR4","doi-asserted-by":"publisher","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. Inf. Process. Lett.\u00a081(6), 309\u2013312 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.7151\/dmgt.1237","volume":"24","author":"W. Klostermeyer","year":"2004","unstructured":"Klostermeyer, W., MacGillivray, G.: Analogs of cliques for oriented coloring. Discussiones Mathematicae Graph Theory\u00a024(3), 373\u2013388 (2004)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.10027","volume":"40","author":"W. Goddard","year":"2002","unstructured":"Goddard, W., Henning, M.A.: Domination in planar graphs with small diameter. J. Graph Theory\u00a040, 1\u201325 (2002)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:40:05Z","timestamp":1558302005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}