On degree sum conditions for long cycles and cycles through specified vertices

DOI10.1016/j.disc.2007.10.048zbMath1169.05023OpenAlexW2091189956MaRDI QIDQ998401

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.048

zbMATH Keywords

circumferencedegree sumcyclable

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (8)

Hamilton cycles in implicit 2-heavy graphs ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Degree bounded spanning trees ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A degree sum condition for longest cycles in 3-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On a conjecture of Bondy
• A lower bound for the circumference of a graph
• Cycles through subsets with large degree sums
• A note on a generalisation of Ore's condition
• Large cycles in graphs
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• 2‐neighborhoods and hamiltonian conditions
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree

This page was built for publication: On degree sum conditions for long cycles and cycles through specified vertices