Hamiltonicity and structure of connected biclaw-free graphs

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.

Authors

Publication Details

Journal
Discrete Applied Mathematics
Published
2026-08-14
DOI
https://doi.org/10.1016/j.dam.2026.07.015
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hamiltonicity and structure of connected biclaw-free graphs

Alexey Pokrovskiy
Discrete Applied Mathematics
Limits and Structures in Graph Theory
article

Hamiltonicity and structure of connected biclaw-free graphs

Alexey Pokrovskiy
article en

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.

Discrete Applied MathematicsVol. 395
Department of Mathematics, University College London
Openalex Percentile: Top 92%
Limits and Structures in Graph Theory
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hamiltonicity and structure of connected biclaw-free graphs — Alexey Pokrovskiy · Discrete Applied Mathematics (2026) | TGRS Research Map | TGRS