{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:33Z","timestamp":1725896433010},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_9","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"60-71","source":"Crossref","is-referenced-by-count":2,"title":["Forbidden Subgraph Colorings and the Oriented Chromatic Number"],"prefix":"10.1007","author":[{"given":"N. R.","family":"Aravind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Aravind, N.R., Subramanian, C.R.: Bounds on proper colorings with restrictions on the union of color classes. Submitted to a Journal"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF02762708","volume":"94","author":"N. Alon","year":"1996","unstructured":"Alon, N., Mohar, B., Sanders, D.P.: On acyclic colorings of graphs on surfaces. Israel Journal of Mathematics\u00a094, 273\u2013283 (1996)","journal-title":"Israel Journal of Mathematics"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P","volume":"24","author":"A.V. Kostochka","year":"1997","unstructured":"Kostochka, A.V., Sopena, E., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. Journal of Graph Theory\u00a024(4), 331\u2013340 (1997)","journal-title":"Journal of Graph Theory"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics\u00a014, 390\u2013408 (1973)","journal-title":"Israel Journal of Mathematics"},{"key":"9_CR5","first-page":"51","volume":"17","author":"M.O. Albertson","year":"1976","unstructured":"Albertson, M.O., Berman, D.M.: The acyclic chromatic number. Congr. Numer.\u00a017, 51\u201360 (1976)","journal-title":"Congr. Numer."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-G","volume":"25","author":"E. Sopena","year":"1997","unstructured":"Sopena, E.: The chromatic number of oriented graphs. Journal of Graph Theory\u00a025(2), 191\u2013205 (1997)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"9_CR7","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":"9_CR8","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J. Nesetril","year":"2006","unstructured":"Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb.\u00a027(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1991","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Struct. Algorithms\u00a02(3), 277\u2013288 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G. Ringel","year":"1968","unstructured":"Ringel, G., Youngs, J.W.T.: Solution of the heawood map coloring problem. Proc. Nat. Acd. Sci. U.S.A.\u00a060, 438\u2013445 (1968)","journal-title":"Proc. Nat. Acd. Sci. U.S.A."},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"O.V. Borodin","year":"1979","unstructured":"Borodin, O.V.: Acyclic colorings of planar graphs. Discrete Mathematics\u00a025(3), 211\u2013236 (1979)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:38Z","timestamp":1619782478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}