The specification of 2-trees
From MaRDI portal
The authors obtain a number of relations, including a dissymmetry theorem, for enumerating various types of 2-trees. For example, they give recurrence relations for the number of unlabelled rooted and unrooted 2-trees; and they determine the asymptotic behaviour of the number of unlabelled 2-trees and the number of oriented-edge rooted 2-trees.
Recommendations
- Enumeration of solid 2-trees according to edge number and edge degree distribution
- Labelled and unlabelled enumeration of k-gonal 2-trees
- A classification of plane and planar 2-trees
- Enumération des 2-arbes k-gonaux. (Enumeration of k-gonal 2-trees)
- Enumeration of k-gonal 2-trees according to size and perimeter
Cites work
- Asymptotic Methods in Enumeration
- Central and local limit theorems applied to asymptotic enumeration
- Combinatorial addition formulas and applications
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3315024 (Why is no real title available?)
- scientific article; zbMATH DE number 3329638 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On acyclic simplicial complexes
- On simple characterizations of k-trees
- On some relations between 2-trees and tree metrics
- On the number of labeled 2-trees
- On the Number of Plane 2-Trees
- The game coloring number of pseudo partial \(k\)-trees
- The number of labeled k-dimensional trees
- The number of trees
Cited in
(18)- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Random enriched trees with applications to random graphs
- Labelled and unlabelled enumeration of k-gonal 2-trees
- A shifted asymmetry index series
- A classification of plane and planar 2-trees
- Limits of random tree-like discrete structures
- On minimum average stretch spanning trees in polygonal 2-trees
- Counting unlabeled \(k\)-trees
- Enumeration of solid 2-trees according to edge number and edge degree distribution
- An asymptotic analysis of labeled and unlabeled k-trees
- scientific article; zbMATH DE number 125494 (Why is no real title available?)
- Graph limits of random unlabelled k-trees
- The mathematical life of Pierre Leroux
- Graph limits of random graphs from a subset of connected k-trees
- Interview with Ira Gessel
- Even permutations and oriented sets: their shifted asymmetry index series
- Enumeration of 2-trees with directed cells
- Prime graphs and exponential composition of species
This page was built for publication: The specification of 2-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696853)
