Longest paths joining given vertices in a graph

DOI10.1007/BF02941511zbMATH Open0613.05033MaRDI QIDQ1088682FDOQ1088682

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)

Cites Work

• On maximal paths and circuits of graphs
• Long paths and large cycles in finite graphs
• On a conjecture of Bondy
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Degree bounds for the circumference of 3‐connected graphs
• Bounding the distance among longest paths in a connected graph
• On the circumference of 3-connected graphs
• On hamiltonicity of \(P_{3}\)-dominated graphs
• Intersection of longest paths in a graph
• On the circumference of 3-connected quasi-claw-free graphs
• Maintaining longest paths incrementally
• Longest cycles in triangle-free graphs
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• On the circumferences of regular 2-connected graphs

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

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