Enumerating k-trees

DOI10.1016/0012-365X(71)90023-9MaRDI QIDQ2546877zbMATH OpenOpenAlexFDO

Authors Dominique Foata

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)

Cites work

• scientific article; zbMATH DE number 3329638 (Why is no real title available?)
• scientific article; zbMATH DE number 3409479 (Why is no real title available?)
• On acyclic simplicial complexes
• On the number of labeled 2-trees
• Réarrangements de fonctions et dénombrement
• The number of labeled k-dimensional trees
• The number of labeled k-trees

Cited in

(14)

• Limits of random tree-like discrete structures
• Bijective linear time coding and decoding for \(k\)-trees
• Binomial sequences
• Chordal graphs with bounded tree-width (extended abstract)
• A coding algorithm for Rényi trees
• Graph limits of random unlabelled k-trees
• Enumeration of labelled \((k,m)\)-trees
• An asymptotic analysis of labeled and unlabeled k-trees
• Bijections on \(r\)-Shi and \(r\)-Catalan arrangements
• Graph limits of random graphs from a subset of connected k-trees
• Bijective and automated approaches to Abel sums
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• Counting unlabeled \(k\)-trees
• Random enriched trees with applications to random graphs

This page was built for publication: Enumerating k-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546877)