Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
From MaRDI portal
Publication:1826940
DOI10.1016/j.jcta.2004.01.009zbMath1042.05007arXivmath/0312424OpenAlexW1994907374MaRDI QIDQ1826940
Cédric Lamathe, Gilbert Labelle, Pierre Leroux
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0312424
Related Items (7)
The mathematical life of Pierre Leroux ⋮ An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Shape Measures of Random Increasing k-trees ⋮ Counting unlabeled \(k\)-trees ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components ⋮ Enumeration of solid 2-trees according to edge number and edge degree distribution ⋮ On minimum average stretch spanning trees in polygonal 2-trees
Uses Software
Cites Work
- The specification of 2-trees
- Une théorie combinatoire des séries formelles
- On the cell-growth problem for arbitrary polygons
- Computing the molecular expansion of species with the Maple package Devmol
- A classification of plane and planar 2-trees
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution
- The number of trees
- Asymptotic Methods in Enumeration
- On the number of labeled 2-trees
- On the Number of Plane 2-Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Labelled and unlabelled enumeration of \(k\)-gonal 2-trees