An implicit degree sum condition for cycles through specified vertices
From MaRDI portal
Publication:2410579
DOI10.1016/j.ipl.2017.09.006zbMath1420.05038OpenAlexW2760205077MaRDI QIDQ2410579
Publication date: 18 October 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.09.006
Cites Work
- Implicit-degrees and circumferences
- On degree sum conditions for long cycles and cycles through specified vertices
- An implicit degree condition for long cycles in 2-connected graphs
- Cycles through subsets with large degree sums
- Cycles through prescribed vertices with large degree sum
- A note on a generalisation of Ore's condition
- Large cycles in graphs
- A note on Hamiltonian circuits
- Hamilton cycles in implicit 2-heavy graphs
- An Implicit Degree Condition for Cyclability in Graphs
- Note on Hamilton Circuits
- 2‐neighborhoods and hamiltonian conditions
- Unnamed Item
- Unnamed Item