A degree condition for cycles passing through specified vertices and edges
From MaRDI portal
Publication:6056727
DOI10.1016/j.disc.2023.113633zbMath1522.05045MaRDI QIDQ6056727
Shuya Chiba, Masao Tsugaki, Tomoki Yamashita
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Cycles through specified vertices
- On a cycle through a specified linear forest of a graph
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Circuits through specified edges
- On some intriguing problems in Hamiltonian graph theory---a survey
- Recent advances on the Hamiltonian problem: survey III
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- 2‐neighborhoods and hamiltonian conditions
- Cycles containing matchings and pairwise compatible euler tours