Theory of path length distributions. I

DOI10.1016/0012-365X(73)90035-6zbMath0263.05115OpenAlexW2044231347MaRDI QIDQ2561240

Cecil C. Rousseau, Ralph J. Faudree, Richard H. Schelp

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90035-6

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (8)

Path connected graphs ⋮ Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected ⋮ On path connected graphs ⋮ Panconnected graphs. II ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Maximum non-path-connected graphs ⋮ Pancyclism in hamiltonian graphs ⋮ Path extendable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of homeomorphically irreducible trees, and other species
• Arc coverings of graphs
• Hamilton connected graphs
• Parallel concepts in graph theory
• Note on Hamilton Circuits

This page was built for publication: Theory of path length distributions. I