The Hamiltonian properties in \(K_{1,r}\)-free split graphs
From MaRDI portal
Publication:2124619
DOI10.1016/j.disc.2022.112826zbMath1486.05169OpenAlexW4283399124WikidataQ114190548 ScholiaQ114190548MaRDI QIDQ2124619
Guowei Dai, Zan-Bo Zhang, Xiaoyan Zhang, Hajo J. Broersma
Publication date: 11 April 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112826
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- How many conjectures can you stand? A survey
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- The strong perfect graph theorem
- A note on Hamiltonian split graphs
- Advances on the Hamiltonian problem -- a survey
- On some intriguing problems in Hamiltonian graph theory---a survey
- Split graphs
- Toughness, hamiltonicity and split graphs
- On the Burkard-Hammer condition for Hamiltonian split graphs
- Tough graphs and Hamiltonian circuits.
- A Survey on Hamiltonian Cycles
- The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
- Updating the hamiltonian problem—A survey
- Split Graphs Having Dilworth Number Two
- Some Theorems on Abstract Graphs
This page was built for publication: The Hamiltonian properties in \(K_{1,r}\)-free split graphs