On degree sum conditions for long cycles and cycles through specified vertices
From MaRDI portal
Publication:998401
DOI10.1016/J.DISC.2007.10.048zbMATH Open1169.05023OpenAlexW2091189956MaRDI QIDQ998401FDOQ998401
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
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
- Note on Hamilton Circuits
- A note on Hamiltonian circuits
- 2‐neighborhoods and hamiltonian conditions
- Title not available (Why is that?)
- Large cycles in graphs
- 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
- Title not available (Why is that?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
Cited In (16)
- 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
- Title not available (Why is that?)
- A degree sum condition for longest cycles in 3-connected graphs
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- A degree sum condition for long cycles passing through a linear forest
- Any long cycles covering specified independent vertices
- Long cycles passing through a specified edge in 3-connected graphs
- An implicit degree sum condition for cycles through specified vertices
- Degree bounded spanning trees
- 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
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)
