The numbers of labeled colored and chromatic trees
From MaRDI portal
Publication:768644
DOI10.1007/BF02392398zbMath0077.36801MaRDI QIDQ768644
Publication date: 1957
Published in: Acta Mathematica (Search for Journal in Brave)
Related Items (5)
The number of trees with a 1-factor ⋮ Forbidden subgraphs in connected graphs ⋮ The number of plane trees with a given partition ⋮ A contect-free language and enumeration problems on infinite trees and digraphs ⋮ The number of homeomorphically irreducible trees, and other species
Cites Work
- The number of labeled two-terminal series-parallel networks
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- The number of trees
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
- Some Elementary Identities of Ordered Abelian Sets
- The Number of Linear, Directed, Rooted, and Connected Graphs
This page was built for publication: The numbers of labeled colored and chromatic trees