{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:33Z","timestamp":1761805293060},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_61","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"707-718","source":"Crossref","is-referenced-by-count":4,"title":["Colouring AT-Free Graphs"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Bang Le, V., Spinrad, J.: Graph classes:\u00a0a survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"61_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"H.-J. Broersma","year":"1999","unstructured":"Broersma, H.-J., 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":"61_CR3","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s00453-001-0091-x","volume":"32","author":"H.-J. Broersma","year":"2002","unstructured":"Broersma, H.-J., Kloks, T., Kratsch, D., M\u00fcller, H.: A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Algorithmica\u00a032, 594\u2013610 (2002)","journal-title":"Algorithmica"},{"key":"61_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a010, 399\u2013430 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"D.G. Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM Journal on Computing\u00a028, 1284\u20131297 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"61_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-25870-1_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.-F. Couturier","year":"2011","unstructured":"Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: List Coloring in the Absence of a Linear Forest. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 119\u2013130. Springer, Heidelberg (2011)"},{"key":"61_CR7","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. Freeman, New York (1979)"},{"key":"61_CR8","first-page":"325","volume":"21","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Annals on Discrete Mathematics\u00a021, 325\u2013356 (1984)","journal-title":"Annals on Discrete Mathematics"},{"key":"61_CR9","unstructured":"Golovach, P.: Private communication"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-complete column: an ongoing guide. Journal of Algorithms\u00a06, 434\u2013451 (1985)","journal-title":"Journal of Algorithms"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BFb0024501","volume-title":"WG 1997","author":"T. Kloks","year":"1997","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Asteroidal Sets in Graphs. In: M\u00f6hring, R.H. (ed.) WG 1997. LNCS, vol.\u00a01335, pp. 229\u2013241. Springer, Heidelberg (1997)"},{"key":"61_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.1998.0997","volume":"32","author":"T. Kloks","year":"1999","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Approximating the bandwidth for asteroidal triple-free graphs. Journal of Algorithms\u00a032, 41\u201357 (1999)","journal-title":"Journal of Algorithms"},{"key":"61_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s003730170043","volume":"17","author":"T. Kloks","year":"2001","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics\u00a017, 295\u2013306 (2001)","journal-title":"Graphs and Combinatorics"},{"key":"61_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D. Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Applied Mathematics\u00a099, 111\u2013123 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR15","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1016\/j.dam.2007.10.006","volume":"156","author":"D. Kratsch","year":"2008","unstructured":"Kratsch, D., M\u00fcller, H., Todinca, I.: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics\u00a0156, 1936\u20131947 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C.G. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae\u00a051, 45\u201364 (1962)","journal-title":"Fundamenta Mathematicae"},{"key":"61_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-17514-5_13","volume-title":"Algorithms and Computation","author":"J. Stacho","year":"2010","unstructured":"Stacho, J.: 3-Colouring AT-Free Graphs in Polynomial Time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 144\u2013155. Springer, Heidelberg (2010)"},{"key":"61_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"J.R. Walter","year":"1978","unstructured":"Walter, J.R.: Representations of chordal graphs as subtrees of a tree. Journal of Graph Theory\u00a02, 265\u2013267 (1978)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:04Z","timestamp":1620129304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}