The number of labeled k-trees
From MaRDI portal
Publication:5565633
DOI10.1016/S0021-9800(69)80119-5zbMath0175.50203MaRDI QIDQ5565633
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Properties and characterizations of k ‐trees, Counting acyclic digraphs by sources and sinks, A coding algorithm for Rényi trees, Maximal dissections of a simplex, Enumeration of labelled \((k,m)\)-trees, On some relations between 2-trees and tree metrics, A note on Abel polynomials and rooted labeled forests, Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications, Bell numbers and \(k\)-trees, Enumerating k-trees