Enumeration of solid 2-trees according to edge number and edge degree distribution

DOI10.1016/j.disc.2004.11.015zbMath1070.05049OpenAlexW1979595999MaRDI QIDQ2566279

Cédric Lamathe, Michel Bousquet

Publication date: 22 September 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.015

zbMATH Keywords

Pólya theoryCombinatorial species

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (2)

Counting unlabeled \(k\)-trees ⋮ Prime graphs and exponential composition of species

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The specification of 2-trees
• Enumeration of \(m\)-ary cacti
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• A classification of plane and planar 2-trees
• Enumeration of (uni- or bicolored) plane trees according to their degree distribution
• The number of labeled k-dimensional trees
• On the Number of Plane 2-Trees

This page was built for publication: Enumeration of solid 2-trees according to edge number and edge degree distribution