Counting unlabeled \(k\)-trees
From MaRDI portal
Publication:2452429
DOI10.1016/j.jcta.2014.05.002zbMath1295.05078arXiv1309.1429OpenAlexW2142314766MaRDI QIDQ2452429
Ira M. Gessel, Andrew Gainer-Dewar
Publication date: 3 June 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1429
Related Items (9)
An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Random enriched trees with applications to random graphs ⋮ On maximum Estrada indices of \(k\)-trees ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ On the number of labeled graphs of bounded treewidth ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ Bijections on \(r\)-Shi and \(r\)-Catalan arrangements ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees
Cites Work
- The specification of 2-trees
- Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
- A classification of plane and planar 2-trees
- \(\Gamma \)-species and the enumeration of \(k\)-trees
- Enumerating k-trees
- Enumeration of solid 2-trees according to edge number and edge degree distribution
- The number of trees
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Counting unlabeled \(k\)-trees