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

DOI10.1016/J.DISC.2007.10.048MaRDI QIDQ998401zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Any long cycles covering specified independent vertices
• A degree sum condition for long cycles passing through a linear forest
• Degree sum conditions for vertex-disjoint cycles passing through specified vertices
• Cycles through prescribed vertices with large degree sum
• Long cycles in graphs with large degree sums

Cites work

• scientific article; zbMATH DE number 3515497 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• 2‐neighborhoods and hamiltonian conditions
• A lower bound for the circumference of a graph
• A note on Hamiltonian circuits
• A note on a generalisation of Ore's condition
• Cycles through subsets with large degree sums
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Large cycles in graphs
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Note on Hamilton Circuits
• On a conjecture of Bondy

Cited in

(17)

• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
• Hamilton cycles in implicit 2-heavy graphs
• Cycles through prescribed vertices with large degree sum
• Cycles through specified vertices
• A degree condition for cycles passing through specified vertices and edges
• On degree sum conditions for 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
• scientific article; zbMATH DE number 6770098 (Why is no real title available?)
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles
• Forbidden subgraphs for longest cycles to contain vertices with large degrees
• A degree sum condition for long cycles passing through a linear forest
• Any long cycles covering specified independent vertices
• An implicit degree sum condition for cycles through specified vertices
• Degree bounded spanning trees
• Long cycles passing through a specified edge in 3-connected graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

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

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