The number of homeomorphically irreducible trees, and other species

DOI10.1007/BF02559543MaRDI QIDQ770044zbMATHOpenAlexFDO

Authors Frank Harary, Geert C. E. Prins

Publication date 1959

Published in Acta Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02559543

zbMATH Keywords

topology

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 Number of Husimi Trees
• On the notion of balance of a signed graph
• The Dissimilarity Characteristic of Linear Graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs
• The dissimilarity characteristic of Husimi trees
• The number of trees
• The numbers of labeled colored and chromatic trees

Cited in

(33)

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

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)