The number of homeomorphically irreducible trees, and other species

Cites work

COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
Enumeration Of Labelled Graphs
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
Note on the Polya and Otter formulas for enumerating trees
On the notion of balance of a signed graph
On the Number of Husimi Trees
The dissimilarity characteristic of Husimi trees
The Dissimilarity Characteristic of Linear Graphs
The Number of Linear, Directed, Rooted, and Connected Graphs
The number of trees
The numbers of labeled colored and chromatic trees

Cited in

(36)

Estimation of the neutral mutation rate in a finite population from DNA sequence data
On asymmetric structures
Counting asymmetric enriched trees
The distribution of degrees in a large random tree
The blossoming of Schröder's fourth problem
Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices
Hereditarily finite sets and identity trees
Universal expansion of the powers of a derivation
Enumeration of (uni- or bicolored) plane trees according to their degree distribution
An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees
Minimum status of series-reduced trees with given parameters
The sets of star and semistar operations on semilocal Prüfer domains
Superposition of snarks revisited
Spanning trees without adjacent vertices of degree 2
On the enumeration of finite maximal connected topologies
The least number of edges for graphs having dihedral automorphism group
Theory of path length distributions. I
On the Edge-sets of Rigid and Corigid Graphs
The probability that a point of a tree is fixed
Extremal results on average subtree density of series-reduced trees
A Stability Theorem for Minimum Edge Graphs with Given Abstract Automorphism Group
Homeomorphically irreducible spanning trees
The distance spectral radius of trees
On acyclic simplicial complexes
On nodes of degree two in random trees
The number of plane trees with a given partition
The enumeration of tree-like polyhexes
Cubic identity graphs and planar graphs derived from trees
The burning number conjecture is true for trees without degree-2 vertices
Random trees have height \(O(\sqrt{n})\)
The number of odd spanning trees in the complete graphs
On the symmetry and asymmetry of combinatorial structures
Extremal results on the Mostar index of trees with fixed parameters
Testing network correlation efficiently via counting trees
The number of functional digraphs
On the number of broadcast schemes in networks

This page was built for publication: The number of homeomorphically irreducible trees, and other species

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