The number of labeled k-trees
From MaRDI portal
Publication:5565633
DOI10.1016/S0021-9800(69)80119-5zbMATH Open0175.50203MaRDI QIDQ5565633FDOQ5565633
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Cited In (23)
- On the structure and deficiency of \(k\)-trees with bounded degree
- Bell numbers and \(k\)-trees
- Counting acyclic digraphs by sources and sinks
- Limits of random tree-like discrete structures
- Bijective linear time coding and decoding for \(k\)-trees
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- On some relations between 2-trees and tree metrics
- A coding algorithm for Rényi trees
- Graph limits of random unlabelled k-trees
- Properties and characterizations of k ‐trees
- Minimum triplet covers of binary phylogenetic \(X\)-trees
- Enumeration of labelled \((k,m)\)-trees
- An asymptotic analysis of labeled and unlabeled \(k\)-trees
- Graph limits of random graphs from a subset of connected k‐trees
- Ancestors and descendants in evolving k‐tree models
- On the number of labeled graphs of bounded treewidth
- A note on Abel polynomials and rooted labeled forests
- Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications
- Chordal graphs with bounded tree-width
- Counting unlabeled \(k\)-trees
- Enumerating k-trees
- Random enriched trees with applications to random graphs
- Maximal dissections of a simplex
This page was built for publication: The number of labeled k-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565633)
