Long cycles in graphs without Hamiltonian paths

DOI10.1016/J.DISC.2007.10.049zbMATH Open1229.05176OpenAlexW2009542477MaRDI QIDQ998320FDOQ998320

Kenta Ozeki, Ken-ichi Kawarabayashi, Tomoki Yamashita

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.049

Recommendations

• Relative length of longest paths and cycles in graphs
• Longest paths and longest cycles in graphs with large degree sums
• On longest cycles and strongly linking vertex sets
• Relationships between the length of a longest path and the relative length
• Long paths, long cycles, and their relative length

zbMATH Keywords

longest cyclelongest pathrelative length

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Relative length of long paths and cycles in graphs with large degree sums
• Relative length of longest paths and cycles in graphs
• On relative length of longest paths and cycles
• Relative lengths of paths and cycles in 3-connected graphs
• Relative length of longest paths and cycles in 3-connected graphs
• Longest paths and longest cycles in graphs with large degree sums

Cited In (9)

• A degree sum condition for graphs to be covered by two cycles
• Title not available (Why is that?)
• Finding long paths and cycles in sparse Hamiltonian graphs
• On relative length of longest paths and cycles
• Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
• Title not available (Why is that?)
• Some results on graphs without long induced paths
• A bound on relative lengths of triangle-free graphs
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li

This page was built for publication: Long cycles in graphs without Hamiltonian paths

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