{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:05:43Z","timestamp":1777539943967,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578994","type":"print"},{"value":"9783540483854","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:00Z","timestamp":1330263600000},"page":"177-188","source":"Crossref","is-referenced-by-count":9,"title":["Deciding 3-colourability in less than O(1.415n) steps"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Schiermeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (Macmillan, London and Elsevier, New York, 1976)."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N. Christofides","year":"1971","unstructured":"N. Christofides, An Algorithm for the Chromatic Number of a Graph, Computer J. 14(1971)38\u201339.","journal-title":"Computer J."},{"key":"16_CR3","volume-title":"A Guide to the Theory of N P-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of N P-Completeness, W. H. Freeman and Company, New York, 1979."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","volume":"23","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey and D. S. Johnson, The complexity of Near-Optimal Graph Coloring, J. ACM 23 (1976) 43\u201349.","journal-title":"J. ACM"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0196-6774(92)90052-E","volume":"13","author":"D. S. Johnson","year":"1992","unstructured":"D. S. Johnson, The NP-Completeness Column: An Ongoing Guide, J. of Alg. 13 (1992) 502\u2013524.","journal-title":"J. of Alg."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler, A Note on the Complexity of the Chromatic Number Problem, Inform. Process. Lett. 5 (1976) 66\u201367.","journal-title":"Inform. Process. Lett."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. W. Moon","year":"1965","unstructured":"J. W. Moon and L. Moser, On Cliques in Graphs, Israel J. of Math. 3 (1965) 23\u201328.","journal-title":"Israel J. of Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:36Z","timestamp":1619572176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}