Enumerating k-trees

DOI10.1016/0012-365X(71)90023-9zbMath0219.05066OpenAlexW2075406627MaRDI QIDQ2546877

Foata, Dominique

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0012-365x(71)90023-9

Mathematics Subject Classification ID

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

Related Items (13)

An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Random enriched trees with applications to random graphs ⋮ Binomial sequences ⋮ Limits of random tree-like discrete structures ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Counting unlabeled \(k\)-trees ⋮ A coding algorithm for Rényi trees ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ On the number of labeled graphs of bounded treewidth ⋮ 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 ⋮ Enumeration of labelled \((k,m)\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• On the number of labeled 2-trees
• The number of labeled k-trees
• Réarrangements de fonctions et dénombrement

This page was built for publication: Enumerating k-trees