{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879318,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_9","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs"],"prefix":"10.1007","author":[{"given":"Flavia","family":"Bonomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maya","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Valencia-Pabon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. U.S.A. 43, 842\u2013844 (1957)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"HL Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: Achromatic number is NP-complete for cographs and interval graphs. Inf. Process. Lett. 31, 135\u2013138 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00373-008-0829-1","volume":"25","author":"F Bonomo","year":"2009","unstructured":"Bonomo, F., Dur\u00e1n, G., Maffray, F., Marenco, J., Valencia-Pabon, M.: On the b-coloring of cographs and $$P_4$$-sparse graphs. Graphs Comb. 25(2), 153\u2013167 (2009)","journal-title":"Graphs Comb."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5, 266\u2013277 (1957)","journal-title":"Oper. Res."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"9_CR6","unstructured":"Faik, T.: La b-continuit\u00e9 des b-colorations: complexit\u00e9, propri\u00e9t\u00e9s structurelles et algorithmes. Ph.D. thesis, L.R.I., Universit\u00e9 Paris-Sud, Orsay, France (2005)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S0021-9800(70)80072-2","volume":"8","author":"F Harary","year":"1970","unstructured":"Harary, F., Hedetniemi, S.: The achromatic number of a graph. J. Comb. Theor. 8, 154\u2013161 (1970)","journal-title":"J. Comb. Theor."},{"issue":"18","key":"9_CR8","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.dam.2011.10.017","volume":"160","author":"F Havet","year":"2012","unstructured":"Havet, F., Linhares-Sales, C., Sampaio, L.: b-coloring of tight graphs. Discrete Appl. Math. 160(18), 2709\u20132715 (2012)","journal-title":"Discrete Appl. Math."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.dam.2005.04.001","volume":"152","author":"CT Ho\u00e0ng","year":"2005","unstructured":"Ho\u00e0ng, C.T., Kouider, M.: On the b-dominating coloring of graphs. Discrete Appl. Math. 152, 176\u2013186 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"17","key":"9_CR10","doi-asserted-by":"publisher","first-page":"3519","DOI":"10.1016\/j.dam.2009.02.023","volume":"157","author":"CT Ho\u00e0ng","year":"2009","unstructured":"Ho\u00e0ng, C.T., Linhares Sales, C., Maffray, F.: On minimally b-imperfect graphs. Discrete Appl. Math. 157(17), 3519\u20133530 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"RW Irving","year":"1999","unstructured":"Irving, R.W., Manlove, D.F.: The b-chromatic number of a graph. Discrete Appl. Math. 91, 127\u2013141 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9_CR12","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J., Voigt, M.: b-continuity. Technical report M 14\/04, Technical University Ilmenau, Faculty of Mathematics and Natural Sciences (2004)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36379-3_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl, J., Tuza, Z., Voigt, M.: On the b-Chromatic number of graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 310\u2013320. Springer, Heidelberg (2002)"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(88)90100-X","volume":"22","author":"G Tinhofer","year":"1989","unstructured":"Tinhofer, G.: Strong tree-cographs are Birkoff graphs. Discrete Appl. Math. 22(3), 275\u2013288 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T04:51:24Z","timestamp":1720759884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":15,"aliases":["10.1007\/978-3-319-14115-2_9"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}