{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:31Z","timestamp":1725456631008},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_17","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T04:42:25Z","timestamp":1350880945000},"page":"148-159","source":"Crossref","is-referenced-by-count":0,"title":["On the Stable Degree of Graphs"],"prefix":"10.1007","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/j.ic.2011.04.003","volume":"209","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Information & Computation\u00a0209, 1103\u20131119 (2011)","journal-title":"Information & Computation"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0166-218X(02)00414-6","volume":"131","author":"V. Bouchitt\u00e9","year":"2003","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Approximating the treewidth of AT-free graphs. Discrete Applied Mathematics\u00a0131, 11\u201337 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(03)00440-2","volume":"136","author":"V. Bouchitt\u00e9","year":"2004","unstructured":"Bouchitt\u00e9, V., Kratsch, D., M\u00fcller, H., Todinca, I.: On treewidth approximations. Discrete Applied Mathematics\u00a0136, 183\u2013196 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR5","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":"17_CR6","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":"17_CR7","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":"17_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. III: Tree-decompositions, minors and complexity issues. RAIRO. Informatique Th\u00e9orique et Applications\u00a026, 257\u2013286 (1992)","journal-title":"RAIRO. Informatique Th\u00e9orique et Applications"},{"key":"17_CR9","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 of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(96)00206-X","volume":"175","author":"T. Kloks","year":"1997","unstructured":"Kloks, T., Kratsch, D., Spinrad, J.: On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science\u00a0175, 309\u2013335 (1997)","journal-title":"Theoretical Computer Science"},{"key":"17_CR11","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":"17_CR12","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":"17_CR13","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":"17_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0166-218X(95)00095-9","volume":"64","author":"R.H. M\u00f6hring","year":"1996","unstructured":"M\u00f6hring, R.H.: Triangulating graphs without asteroidal triples. Discrete Applied Mathematics\u00a064, 281\u2013287 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-59071-4_34","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Ramachandramurthi","year":"1995","unstructured":"Ramachandramurthi, S.: A Lower Bound for Treewidth and its Consequences. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 14\u201325. Springer, Heidelberg (1995)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Applied Mathematics\u00a08, 85\u201389 (1984)","journal-title":"Discrete Applied Mathematics"}],"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-34611-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:00:40Z","timestamp":1620118840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}