Hamiltonicity and structure of connected biclaw-free graphs
Abstract
We show that for sufficiently large $d$, every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li.
Fields of Study & Subjects
Limits and Structures in Graph Theory
Advanced Graph Theory Research
Geometric and Algebraic Topology
Publication details
- Journal / source
- Discrete Applied Mathematics
- Volume
- 395
- Pages
- 63–70
- Publication date
- 14 August 2026
- Language
- EN