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 (22)
An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications ⋮ Random enriched trees with applications to random graphs ⋮ Properties and characterizations of k ‐trees ⋮ Counting acyclic digraphs by sources and sinks ⋮ Bell numbers and \(k\)-trees ⋮ Minimum triplet covers of binary phylogenetic \(X\)-trees ⋮ Limits of random tree-like discrete structures ⋮ On the structure and deficiency of \(k\)-trees with bounded degree ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Counting unlabeled \(k\)-trees ⋮ A coding algorithm for Rényi trees ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ Maximal dissections of a simplex ⋮ On the number of labeled graphs of bounded treewidth ⋮ Enumerating k-trees ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Enumeration of labelled \((k,m)\)-trees ⋮ Ancestors and descendants in evolving k‐tree models ⋮ A note on Abel polynomials and rooted labeled forests ⋮ On some relations between 2-trees and tree metrics
This page was built for publication: The number of labeled k-trees
