{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:08:29Z","timestamp":1732032509431},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427070"},{"type":"electronic","value":"9783540454779"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_6","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:09:01Z","timestamp":1187248141000},"page":"44-54","source":"Crossref","is-referenced-by-count":3,"title":["On the Tree-Degree of Graphs"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Discrete methods 8, (1987), pp. 277\u2013284.","journal-title":"SIAM J. Alg. Discrete methods"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A. Berry","year":"2000","unstructured":"Berry, A., J.-P. Bordat, O. Cogis, Generating all the minimal separators of a graph, Internat. J. Found. Comput. Sci. 11 (2000), pp. 397\u2013403.","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"Booth, K. S., G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci. 13 (1976), pp. 335\u2013379.","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(97)00031-0","volume":"79","author":"H. L. Bodlaender","year":"1997","unstructured":"Bodlaender, H. L., D. M. Thilikos, Tree width of graphs with small chordality, Discrete Applied Mathematics 79, (1997), pp. 45\u201361.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-68530-8_29","volume-title":"Proceedings ESA\u201998","author":"V. Bouchitt\u00e9","year":"1998","unstructured":"Bouchitt\u00e9, V., I. Todinca, Minimal triangulations for graphs with \u201cfew\u201d minimal separators, Proceedings ESA\u201998, LNCS 1461, Springer, 1998, pp. 344\u2013355."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., V. B. Le, and J. P. Spinrad, Graph-classes\u2014A Survey, SIAM monographs on discrete mathematics and application, Philadelphia, (1999).","DOI":"10.1137\/1.9780898719796"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu, H., D. G. Kirkpatrick, Unit disk graph recognition is NP-hard, Comput. Geom. 9, (1998), pp. 3\u201324.","journal-title":"Comput. Geom."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., A. Goodman, L. P\u00f3sa, The representation of graphs by set intersection, Cand. J. Math. 18, (1966), pp. 106\u2013112.","journal-title":"Cand. J. Math."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F., The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory 16, (1974), pp. 47\u201356.","journal-title":"J. Combin. Theory"},{"key":"6_CR10","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C., Algorithmic graph theory and perfect graphs, Academic press, NewY ork, (1980)."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","volume":"55","author":"M. C. Golumbic","year":"1995","unstructured":"Golumbic, M. C., R. E. Jamison, Edge and vertex intersections of paths in trees, Discrete Math. 55, (1995), pp. 151\u2013159.","journal-title":"Discrete Math."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","volume":"38","author":"M. C. Golumbic","year":"1985","unstructured":"Golumbic, M. C., R. E. Jamison, The edge-intersection graphs of paths in a tree, J. Comb. Theory B 38, (1985), pp. 8\u201322","journal-title":"J. Comb. Theory B"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"4","author":"I. Holyer","year":"1981","unstructured":"Holyer, I., The NP-completeness of some edge-partition problems, SIAM J. Comput. 4, 1981, pp. 713\u2013717.","journal-title":"SIAM J. Comput."},{"key":"6_CR14","first-page":"187","volume":"11","author":"D. N. Hoover","year":"1992","unstructured":"Hoover, D. N., Complexity of graph covering problems for graphs of lowdegree, JCMCC 11, 1992, pp. 187\u2013208.","journal-title":"JCMCC"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L. T. Kou","year":"1978","unstructured":"Kou, L. T., L. J. Stockmeyer and C. K. Wong, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Comm. ACM 21, 1978, pp. 135\u2013139.","journal-title":"Comm. ACM"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., String graphs II. Recognising string graphs in NP-hard, J. Comb. Theory B, 52, (1991), pp. 67\u201378.","journal-title":"J. Comb. Theory B"},{"key":"6_CR17","first-page":"231","volume-title":"Proceedings of the Colloquium held at Tihany, Hungary, 1966","author":"L. Lov\u00e1sz","year":"1968","unstructured":"Lov\u00e1sz, L., On coverings of graphs, in: P. Erd\u0151s and G. Katona eds., Proceedings of the Colloquium held at Tihany, Hungary, 1966, Academic Press, New York, 1968, pp. 231\u2013236."},{"key":"6_CR18","first-page":"151","volume":"36","author":"S. Ma","year":"1989","unstructured":"Ma, S., W. D. Wallis and J. Wu, Clique covering of chordal graphs, Utilitas Mathematica 36, (1989), pp. 151\u2013152.","journal-title":"Utilitas Mathematica"},{"key":"6_CR19","first-page":"406","volume":"80","author":"J. Orlin","year":"1977","unstructured":"Orlin, J., Contentment in graph theory, Proc. of the Nederlandse Academie van Wetenschappen, Amsterdam, Series A, 80, 1977, pp. 406\u2013424.","journal-title":"Proc. of the Nederlandse Academie van Wetenschappen, Amsterdam, Series A"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/0213005","volume":"13","author":"N. J. Pullman","year":"1984","unstructured":"Pullman, N. J., Clique covering of graphs IV. Algorithms, SIAM J. Comput. 13, (1984), pp. 57\u201375.","journal-title":"SIAM J. Comput."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan, R. E., Decomposition by clique separators, Discrete Mathematics 55, (1985), pp. 221\u2013223.","journal-title":"Discrete Mathematics"},{"key":"6_CR22","unstructured":"Uehara, R., NP-complete problems on a 3-connected cubic planar graph and their application, Technical report TWCU-M-0004, Tokyo 1996. http:\/\/www.komazawa-u.ac.jp\/~uehara\/ps\/triangle.ps.gz"}],"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\/3-540-45477-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:26:56Z","timestamp":1556756816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}