2 papers
math.CO2026
Sufficient conditions for -free graphs to be Hamilton-connected
Xiaoqiong Xu, Shujie Chen, Fengming Dong +1
The toughness of a non-complete graph , denoted , is defined as \[ τ(G) = \min\left\{ \frac{|S|}{ω(G-S)} : S \subseteq V(G),\ ω(G-S) \geq 2 \right\}, \] where is…
math.CO2026
Extremal problems on disjoint path covers of graphs
Shujie Chen, Tao Tian
In 1962, Erdős characterized the maximum size of nonhamiltonian graphs of order with minimum degree at least . Later, Ning and Peng [Combin. Probab. Comput. 29 (2020) 128-13…