Relative length of longest paths and cycles in 3-connected graphs

DOI10.1002/jgt.1009zbMath0990.05085OpenAlexW4244866937MaRDI QIDQ2746207

Richard H. Schelp, Akira Saito, Rao Li

Publication date: 8 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1009

zbMATH Keywords

3-connected graphlongest cyclelongest path

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (10)

Relative length of longest paths and cycles in graphs ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Degree conditions and relative length of longest paths and cycles in graphs ⋮ Degree sums and dominating cycles ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ A note on a cycle partition problem ⋮ Long cycles in graphs without Hamiltonian paths ⋮ On relative length of longest paths and cycles ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles

Cites Work

• Long cycles in graphs with large degree sums
• On a conjecture of Bondy
• Relative length of long paths and cycles in graphs with large degree sums
• Sequences, claws and cyclability of graphs

This page was built for publication: Relative length of longest paths and cycles in 3-connected graphs