A degree sum condition with connectivity for relative length of longest paths and cycles

DOI10.1016/J.DISC.2009.06.019zbMath1226.05091OpenAlexW2069241802MaRDI QIDQ1045188

Tomoki Yamashita

Publication date: 15 December 2009

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

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

zbMATH Keywords

degree sumlongest cyclelongest pathdominating cycle

Mathematics Subject Classification ID

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

Related Items (6)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Edge-diameter of a graph and its longest cycles ⋮ Large cycles in 4-connected graphs ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Graph invariants and large cycles: a survey

Cites Work

• Unnamed Item
• A generalization of a result of Häggkvist and Nicoghossian
• Degree sum and connectivity conditions for dominating cycles
• Relative length of longest paths and cycles in 3-connected graphs
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• On relative length of longest paths and cycles
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Relative length of long paths and cycles in graphs with large degree sums
• Degree sums, connectivity and dominating cycles in graphs

This page was built for publication: A degree sum condition with connectivity for relative length of longest paths and cycles