{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:17:39Z","timestamp":1761895059695},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_27","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"310-320","source":"Crossref","is-referenced-by-count":69,"title":["On the b-Chromatic Number of Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kratochv\u00edl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margit","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"H.L. Bodlaender","year":"1989","unstructured":"H.L. Bodlaender: Achromatic number is NP-complete for cographs and interval graphs, Inf. Process. Lett. 31 (1989) 135\u2013138","journal-title":"Inf. Process. Lett."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S0021-9800(70)80072-2","volume":"8","author":"F. Harary","year":"1970","unstructured":"F. Harary, S. Hedetniemi: The achromatic number of a graph, J. Combin. Th. 8 (1970) 154\u2013161","journal-title":"J. Combin. Th."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0012-365X(76)90099-6","volume":"16","author":"P. Hell","year":"1976","unstructured":"P. Hell, D.J. Miller: Graphs with given achromatic number, Discrete Math. 16 (1976) 195\u2013207","journal-title":"Discrete Math."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer: The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718\u2013720","journal-title":"SIAM J. Comput."},{"key":"27_CR5","first-page":"27","volume":"19","author":"F. Hughes","year":"1997","unstructured":"F. Hughes, G. MacGilliway: The achromatic number of graphs: A survey and some new results, Bull. Inst. Comb. Appl. 19 (1997) 27\u201356","journal-title":"Bull. Inst. Comb. Appl."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"R. W. Irving","year":"1999","unstructured":"R. W. Irving, D. F. Manlove, The b-chromatic number of a graph, Discrete Applied Math., 91 (1999), 127\u2013141.","journal-title":"Discrete Applied Math."},{"key":"27_CR7","unstructured":"M. Kouider, M. Mah\u00e9o, The b-chromatic number of a graph, manuscript, 2000."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"C. McDiarmid: Achromatic numbers of random graphs, Math. Proc. Camb. Philos. Soc. 92 (1982) 21\u201328","DOI":"10.1017\/S0305004100059648"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1090\/dimacs\/049\/13","volume":"49","author":"J. Kratochv\u00edl","year":"1999","unstructured":"J. Kratochv\u00edl, Zs. Tuza, M. Voigt: New trends in the theory of graph colorings: Choosability and list coloring, In: Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future) (eds. R.L. Graham, J. Kratochv\u00edl, J. Ne\u0161et\u0159il, F.S. Roberts), DIMACS Series in Discrete Mathematics and Theoretical Computer Scienc, Volume 49, American Mathematical Society, Providence, RI, 1999, pp. 183\u2013197","journal-title":"Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future)"},{"key":"27_CR10","unstructured":"D. Manlove: Minimaximal and maximinimal optimization problems: a partial order-based approach, PhD. thesis, University of Glasgow, Dept. of Computing Science, June 1998"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jctb.1995.1027","volume":"64","author":"C. Thomassen","year":"1995","unstructured":"C. Thomassen: 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser B 64 (1995) 101\u2013107","journal-title":"J. Combin. Theory Ser B"}],"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-36379-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T08:28:58Z","timestamp":1551083338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}