1 citations · 1 across the 17 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
Proof of a conjecture on hamiltonian-connected graphs
Petr Vrana, Xingzhi Zhan, Leilei Zhang
We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Br…
math.CO2021
The maximum size of a graph with prescribed order, circumference and minimum degree
Leilei Zhang
Erdős determined the maximum size of a nonhamiltonian graph of order and minimum degree at least in 1962. Recently, Ning and Peng generalized. Erdős' work and gave the maxi…
math.CO2021
The maximum size of a nonhamiltonian graph with given order and connectivity
Xingzhi Zhan, Leilei Zhang
Motivated by work of Erdős, Ota determined the maximum size of a -connected nonhamiltonian graph of order in 1995. But for some pairs the maximum size is not…