Hamiltonicity and structure of connected biclaw-free graphs
Combinatorics
2025-07-09 v1
Abstract
We show that for sufficiently large , every balanced bipartite, connected biclaw-free graph with minimum degree is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li.
Keywords
Cite
@article{arxiv.2507.05836,
title = {Hamiltonicity and structure of connected biclaw-free graphs},
author = {Alexey Pokrovskiy and Xiaoan Yang},
journal= {arXiv preprint arXiv:2507.05836},
year = {2025}
}