{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:24Z","timestamp":1725516804585},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69733-6_41","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"415-424","source":"Crossref","is-referenced-by-count":4,"title":["A New Characterization of P 6-Free Graphs"],"prefix":"10.1007","author":[{"given":"Pim","family":"van \u2019t Hof","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"41_CR1","first-page":"51","volume":"22","author":"G. Bacs\u00f3","year":"1997","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating Subgraphs of Small Diameter. Journal of Combinatorics. Information and System Sciences\u00a022(1), 51\u201362 (1997)","journal-title":"Journal of Combinatorics. Information and System Sciences"},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.7151\/dmgt.1263","volume":"25","author":"G. Bacs\u00f3","year":"2005","unstructured":"Bacs\u00f3, G., Michalak, D., Tuza, Z.: Dominating Bipartite Subgraphs in Graphs. Discussiones Mathematicae Graph Theory\u00a025, 85\u201394 (2005)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"41_CR3","volume-title":"SIAM Monographs on Discrete Mathematics and Applications","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a03. SIAM, Philadelphia (1999)"},{"key":"41_CR4","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"41_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H.\u00a0Freeman and Co., New York (1979)"},{"key":"41_CR6","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding k-Colourability of P\n                           5-Free Graphs in Polynomial Time (submitted, 2006), \n                    \n                      http:\/\/www.cis.uoguelph.ca\/~sawada\/pub.html"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(93)E0111-G","volume":"135","author":"J. Liu","year":"1994","unstructured":"Liu, J., Zhou, H.: Dominating Subgraphs in Graphs with Some Forbidden Structures. Discrete Mathematics\u00a0135, 163\u2013168 (1994)","journal-title":"Discrete Mathematics"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.dam.2006.11.005","volume":"155","author":"J. Liu","year":"2007","unstructured":"Liu, J., Peng, Y., Zhao, C.: Characterization of P\n                           6-Free Graphs. Discrete Applied Mathematics\u00a0155, 1038\u20131043 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR9","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 for P\n                           6-Free Graphs. Discrete Applied Mathematics\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D. Seinsche","year":"1974","unstructured":"Seinsche, D.: On a Property of the Class of n-Colorable Graphs. Journal of Combinatorial Theory Series B\u00a016, 191\u2013193 (1974)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"41_CR11","first-page":"107","volume":"15","author":"J. Sgall","year":"2001","unstructured":"Sgall, J., Woeginger, G.J.: The Complexity of Coloring Graphs without Long Induced Paths. Acta Cybernetica\u00a015(1), 107\u2013117 (2001)","journal-title":"Acta Cybernetica"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.2307\/2034179","volume":"13","author":"E.S. Wolk","year":"1962","unstructured":"Wolk, E.S.: The Comparability Graph of a Tree. Proceedings of the American Mathematical Society\u00a013, 789\u2013795 (1962)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2307\/2033992","volume":"16","author":"E.S. Wolk","year":"1965","unstructured":"Wolk, E.S.: A Note on The Comparability Graph of a Tree. Proceedings of the American Mathematical Society\u00a016, 17\u201320 (1965)","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T05:35:33Z","timestamp":1551504933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540697329","9783540697336"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}