{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:14Z","timestamp":1725579014030},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_9","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"82-89","source":"Crossref","is-referenced-by-count":0,"title":["Dichotomy for Coloring of Dart Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kochol","sequence":"first","affiliation":[]},{"given":"Riste","family":"\u0160krekovski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On coloring the nodes of a network. Proc. Cambridge Phil. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0012-365X(95)00082-8","volume":"158","author":"V. Bryant","year":"1996","unstructured":"Bryant, V.: A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks\u2019 theorem. Discrete Math.\u00a0158, 279\u2013281 (1996)","journal-title":"Discrete Math."},{"key":"9_CR3","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, San Francisco (1979)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1137\/S0097539702418759","volume":"32","author":"M. Kochol","year":"2003","unstructured":"Kochol, M., Lozin, V., Randerath, B.: The 3-colorability problem on graphs with maximum degree four. SIAM J. Comput.\u00a032, 1128\u20131139 (2003)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","volume":"19","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Three short proofs in graph theory. J.\u00a0Combin.\u00a0Theory Ser.\u00a0B\u00a019, 269\u2013271 (1975)","journal-title":"J.\u00a0Combin.\u00a0Theory Ser.\u00a0B"},{"key":"9_CR8","first-page":"3","volume":"26","author":"B. Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I.: A note on Brooks theorem for triangle-free graphs, Australasian. J. Combin.\u00a026, 3\u201310 (2002)","journal-title":"J. Combin."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-45471-3_25","volume-title":"Algorithm Theory - SWAT 2002","author":"S. Skulrattanakulchai","year":"2002","unstructured":"Skulrattanakulchai, S.: \u0394-list vertex coloring in linear time. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 240\u2013248. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:52:32Z","timestamp":1558421552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}