{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:36Z","timestamp":1725569736553},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_18","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"184-195","source":"Crossref","is-referenced-by-count":7,"title":["Colouring Vertices of Triangle-Free Graphs"],"prefix":"10.1007","author":[{"given":"Konrad","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"Rajiv","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks\u00a019, 247\u2013253 (1989)","journal-title":"Networks"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(01)00277-3","volume":"120","author":"S. Brandt","year":"2002","unstructured":"Brandt, S.: Triangle-free graphs and forbidden subgraphs. Discrete Appl. Math.\u00a0120, 25\u201333 (2002)","journal-title":"Discrete Appl. Math."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0012-365X(01)00340-5","volume":"251","author":"S. Brandt","year":"2002","unstructured":"Brandt, S.: A 4-colour problem for dense triangle-free graphs. Discrete Math.\u00a0251, 33\u201346 (2002)","journal-title":"Discrete Math."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.46298\/dmtcs.372","volume":"8","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Klembt, T., Mahfud, S.: P 6- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Math. Theor. Comput. Sci.\u00a08, 173\u2013187 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-10217-2_12","volume-title":"Combinatorial Algorithms","author":"H.J. Broersma","year":"2009","unstructured":"Broersma, H.J., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring P k -free graphs. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 95\u2013104. Springer, Heidelberg (2009)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Systems"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Applied Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Math."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"D.P. Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4 regular graphs are NP-complete. Discrete Math.\u00a030, 289\u2013293 (1980)","journal-title":"Discrete Math."},{"key":"18_CR9","series-title":"Graduate Texts in Mathematics","first-page":"2","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173, pp. xvi+411. Springer, Berlin (2005)","edition":"3"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"C. Hoang","year":"2010","unstructured":"Hoang, C., Kaminski, M., Lozin, V., Sawada, J., Shu, X.: Deciding k-colorability of P 5-free graphs in polynomial time. Algorithmica\u00a057, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Computing\u00a010, 718\u2013720 (1981)","journal-title":"SIAM J. Computing"},{"key":"18_CR12","first-page":"61","volume":"2","author":"M. Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.: Coloring edges and vertices of graphs without short or long cycles. Contributions to Discrete Mathematics\u00a02, 61\u201366 (2007)","journal-title":"Contributions to Discrete Mathematics"},{"key":"18_CR13","first-page":"15","volume":"2","author":"M. Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.: Vertex 3-colorability of claw-free graphs. Algorithmic Operations Research\u00a02, 15\u201321 (2007)","journal-title":"Algorithmic Operations Research"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M. Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Applied Math.\u00a0157, 2747\u20132761 (2009)","journal-title":"Discrete Applied Math."},{"key":"18_CR15","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 4. SIAM J. Computing\u00a032, 1128\u20131139 (2003)","journal-title":"SIAM J. Computing"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Kr\u00e1l","year":"2001","unstructured":"Kr\u00e1l, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.tcs.2007.09.009","volume":"389","author":"V.B. Le","year":"2007","unstructured":"Le, V.B., Randerath, B., Schiermeyer, I.: On the complexity of 4-coloring graphs without long induced paths. Theoret. Comput. Sci.\u00a0389, 330\u2013335 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0012-365X(01)00471-X","volume":"257","author":"V.V. Lozin","year":"2002","unstructured":"Lozin, V.V.: Bipartite graphs without a skew star. Discrete Math.\u00a0257, 83\u2013100 (2002)","journal-title":"Discrete Math."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math.\u00a018, 195\u2013206 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0129054108005772","volume":"19","author":"V. Lozin","year":"2008","unstructured":"Lozin, V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Sci.\u00a019, 477\u2013494 (2008)","journal-title":"International Journal of Foundations of Computer Sci."},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","volume":"162","author":"F. Maffray","year":"1996","unstructured":"Maffray, F., Preissmann, M.: On the NP-completeness of the k-colorability problem for triangle-free graphs. Discrete Math.\u00a0162, 313\u2013317 (1996)","journal-title":"Discrete Math."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(03)00312-1","volume":"276","author":"B. Randerath","year":"2004","unstructured":"Randerath, B.: 3-colorability and forbidden subgraphs. I. Characterizing pairs. Discrete Math.\u00a0276, 313\u2013325 (2004)","journal-title":"Discrete Math."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(01)00335-1","volume":"251","author":"B. Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I., Tewes, M.: Three-colourability and forbidden subgraphs. II. Polynomial algorithms. Discrete Math.\u00a0251, 137\u2013153 (2002)","journal-title":"Discrete Math."},{"key":"18_CR24","first-page":"3","volume":"26","author":"B. Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I.: A note on Brooks\u2019 theorem for triangle-free graphs. Australas. J. Combin.\u00a026, 3\u20139 (2002)","journal-title":"Australas. J. Combin."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs\u2014a survey. Graphs Combin.\u00a020, 1\u201340 (2004)","journal-title":"Graphs Combin."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: 3-colorability \u2208\u2009P for P 6-free graphs. Discrete Appl. Math.\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-J","volume":"24","author":"A.D. Scott","year":"1997","unstructured":"Scott, A.D.: Induced trees in graphs of large chromatic number. J. Graph Theory\u00a024, 297\u2013311 (1997)","journal-title":"J. Graph Theory"},{"key":"18_CR28","first-page":"107","volume":"15","author":"J. Sgall","year":"2001","unstructured":"Sgall, J., W\u00f6ginger, G.J.: The complexity of coloring graphs without long induced paths. Acta Cybernet.\u00a015, 107\u2013117 (2001)","journal-title":"Acta Cybernet."},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM J. Computing"}],"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\/978-3-642-16926-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T09:27:08Z","timestamp":1636795628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}