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 $\ge d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li.