{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:29Z","timestamp":1725571289599},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"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-17514-5_13","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"144-155","source":"Crossref","is-referenced-by-count":7,"title":["3-Colouring AT-Free Graphs in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Stacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(00)00197-9","volume":"105","author":"A. Brandst\u00e4dt","year":"2000","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discrete Applied Mathematics\u00a0105, 39\u201350 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"H. Broersma","year":"1999","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a012, 276\u2013287 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR3","unstructured":"Corneil, D., Stacho, J.: The structure and recognition of C\n                  4-free AT-free graphs (2010) (manuscript)"},{"key":"13_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00208-6","volume":"121","author":"H. Hemper","year":"2002","unstructured":"Hemper, H., Kratsch, D.: On claw-free asteroidal triple-free graphs. Discrete Applied Mathematics\u00a0121, 155\u2013180 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"C.T. Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng, C.T., Kaminski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding k-colorability of P\n                  5-free graphs in polynomial time. Algorithmica\u00a057, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"13_CR8","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., et al.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le Van, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"13_CR9","unstructured":"M\u00fcller, H.: Personal communication"},{"key":"13_CR10","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 \n                    \n                      \n                    \n                    $\\in{\\cal P}$\n                   for P\n                  6-free graphs. Discrete Applied Mathematics\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"13_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, 107\u2013117 (2001)","journal-title":"Acta Cybernetica"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing\u00a01, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR13","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:09:59Z","timestamp":1553260199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}