Longest paths joining given vertices in a graph

DOI10.1007/BF02941511zbMath0613.05033MaRDI QIDQ1088682

Heinz A. Jung

Publication date: 1986

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

longest path

Mathematics Subject Classification ID

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

Related Items (7)

Longest cycles in triangle-free graphs ⋮ Degree bounds for the circumference of 3‐connected graphs ⋮ On the circumference of 3-connected quasi-claw-free graphs ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs ⋮ On the circumferences of regular 2-connected graphs ⋮ On the circumference of 3-connected graphs

Cites Work

• On a conjecture of Bondy
• On maximal paths and circuits of graphs
• Long paths and large cycles in finite graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Longest paths joining given vertices in a graph