{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:02:45Z","timestamp":1747468965577},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_24","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"216-225","source":"Crossref","is-referenced-by-count":4,"title":["Sequences Characterizing k-Trees"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Lotker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debapriyo","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingmar","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Duke, R.A., Winkler, P.M.: Degree Sets of k-Trees: Small k. Israel Journal of Mathematics\u00a040(3-4) (1981)","DOI":"10.1007\/BF02761370"},{"key":"24_CR2","first-page":"261","volume":"35","author":"R.A. Duke","year":"1982","unstructured":"Duke, R.A., Winkler, P.M.: Realizability of almost all degree sets by k-trees. Congressus Numerantium\u00a035, 261\u2013273 (1982)","journal-title":"Congressus Numerantium"},{"key":"24_CR3","first-page":"264","volume":"11","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degree of vertices (Hungarian). Mat. Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P. Erd\u00f6s","year":"1982","unstructured":"Erd\u00f6s, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica\u00a02, 275\u2013288 (1982)","journal-title":"Combinatorica"},{"key":"24_CR5","unstructured":"Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: Proc. of the 8th National Conference on Artificial Intelligence (1990)"},{"key":"24_CR6","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, London (1980)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S.L. Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On the realizability of a set of integers as degrees of the vertices of a graph. J. SIAM Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"J. SIAM Appl. Math."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica\u00a01, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs (Czech). Casopis Pest. Mat.\u00a080, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"key":"24_CR10","unstructured":"Hardy, G.H., Ramanujan, S.: Une formule asymptotique pour le nombres des partitions de n. Comptes Rendus Acad. Sci. Paris, Ser. A (January 2, 1917)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"17","author":"G.H. Hardy","year":"1918","unstructured":"Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. London Math. Soc.\u00a017, 75\u2013115 (1918)","journal-title":"Proc. London Math. Soc."},{"key":"24_CR12","first-page":"510","volume":"41","author":"Z.X. Song","year":"1998","unstructured":"Song, Z.X., Li, J.S., Luo, R.: The Erd\u00f6s-Jacobson-Lehel conjecture on potentially p k -graphic sequences is true. Science in China, Ser. A\u00a041, 510\u2013520 (1998)","journal-title":"Science in China, Ser. A"},{"key":"24_CR13","unstructured":"Justel, C.M., Markenzon, L.: Incremental evaluation of computational circuits. In: Proc. of the Second International Colloquium Journes d\u2019Informatique Messine: JIM 2000 (2000)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth, Universiteit Utrecht (1993)","DOI":"10.1007\/BFb0045375"},{"key":"24_CR15","unstructured":"Jacobson, M.S., Erd\u00f6s, P., Lehel, J.: Graphs realizing the degree sequences and their respective clique numbers. In: Alavi, Y., et al. (eds.) Graph Theory, Combinatorics and Applications, vol.\u00a01, pp. 439\u2013449 (1991)"},{"key":"24_CR16","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"issue":"6","key":"24_CR17","first-page":"199","volume":"14","author":"Y.V. Uspensky","year":"1920","unstructured":"Uspensky, Y.V.: Asymptotic expressions of numerical functions occurring in problems concerning the partition of numbers into summands. Bull. Acad. Sci. de Russie\u00a014(6), 199\u2013218 (1920)","journal-title":"Bull. Acad. Sci. de Russie"},{"key":"24_CR18","first-page":"349","volume":"33","author":"P.M. Winkler","year":"1981","unstructured":"Winkler, P.M.: Graphic Characterization of k-Trees. Congressus Numeratium\u00a033, 349\u2013357 (1981)","journal-title":"Congressus Numeratium"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T12:15:16Z","timestamp":1627733716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11809678_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}