Xingzhi Zhan

activity

20152022

most citedProof of a conjecture on hamiltonian-connected graphs

1 citations · 2 across the 12 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

2 papers · 2 filters

math.CO2022

Graphs with many independent vertex cuts

Yanan Hu, Xingzhi Zhan, Leilei Zhang

The cycles are the only $2$ -connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k \geq 3$ there exist…

math.CO2022

The maximum degree of a minimally hamiltonian-connected graph

Xingzhi Zhan

We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also p…