OFFSET
1,7
COMMENTS
A k-tree is recursively defined as follows: K_k is a k-tree and any k-tree on n+1 vertices is obtained by joining a vertex to a k-clique in a k-tree on n vertices.
REFERENCES
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 328.
LINKS
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
P. Di Francesco, P. Zinn-Justin, and J.-B. Zuber, Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops, arXiv:math-ph/0410002, 2004.
Andrew Gainer-Dewar, Gamma-Species and the Enumeration of k-Trees, Electronic Journal of Combinatorics, Volume 19 (2012), #P45. - From N. J. A. Sloane, Dec 15 2012
Eric Weisstein's World of Mathematics, k-Tree
CROSSREFS
KEYWORD
nonn
AUTHOR
Gordon F. Royle, Dec 05 2002
EXTENSIONS
More terms from Andrew R. Gainer, Dec 03 2011
STATUS
approved