On graphs with at most four line-disjoint paths connecting any two vertices

DOI10.1016/0095-8956(72)90059-7zbMath0228.05117OpenAlexW2033125393MaRDI QIDQ2549704

John L. Leonard

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90059-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (4)

On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ On extremal graphs with exactly one Steiner tree connecting any $k$ vertices ⋮ On k-rails in graphs ⋮ Ein Extremalproblem des Zusammenhangs von Graphen

Cites Work

• Parallel concepts in graph theory
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs with at most four line-disjoint paths connecting any two vertices