{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:10Z","timestamp":1725664570479},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:27Z","timestamp":1330278807000},"page":"403-414","source":"Crossref","is-referenced-by-count":1,"title":["Regular-factors in the complements of partial k-trees"],"prefix":"10.1007","author":[{"given":"Damon","family":"Kaller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Shermer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree decomposable graphs. J. Algorithms, 12:308\u2013340, 1991.","journal-title":"J. Algorithms"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"M.W. Bern, E.L. Lawler, and A.L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216\u2013235, 1987.","journal-title":"J. Algorithms"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. 25 th STOC, pages 226\u2013234, 1993.","DOI":"10.1145\/167088.167161"},{"key":"35_CR4","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s. Extremal Graph Theory. Academic Press, London, 1978."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"R.B. Borie, R.G. Parker, and C.A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555\u2013581, 1992.","journal-title":"Algorithmica"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"B. Courcelle. The monadic second-order logic of graphs. V. On closing the gap between definability and recognizability. Theoret. Comput. Sci., 80:153\u2013202, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jagm.1993.1046","volume":"15","author":"E. Dahlhaus","year":"1993","unstructured":"E. Dahlhaus, P. Hajnal, and M. Karpinski. On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs. J. Algorithms, 15:367\u2013384, 1993.","journal-title":"J. Algorithms"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"G.A. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (Ser. 3), 2:69\u201381, 1952.","journal-title":"Proc. London Math. Soc. (Ser. 3)"},{"key":"35_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"key":"35_CR11","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"D. Kaller, A. Gupta, and T. Shermer. The \u03c7 t -coloring problem. In Proc. 12 th STACS, pages 409\u2013420, 1995.","DOI":"10.1007\/3-540-59042-0_92"},{"key":"35_CR13","unstructured":"S. Mahajan and J.G. Peters. Algorithms for regular properties in recursive graphs. In Proc. 25 th Ann. Allerton Conf. Communication, Control, Comput., pages 14\u201323, 1987."},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen. Die Theorie der regularen Graphen. Acta Math., 15:193\u2013220, 1891.","journal-title":"Acta Math."},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P.D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309\u2013322, 1986.","journal-title":"J. Algorithms"},{"key":"35_CR16","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"W.T. Tutte. The factors of graphs. Can. J. Math., 4:314\u2013328, 1952.","journal-title":"Can. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:14Z","timestamp":1605646574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}