Hui Ma

collaborators

2 papers

math.CO2025

Hamiltonian cycles in $15$ -tough ( $P_{3} \cup 3 P_{1}$ )-free graphs

Hui Ma, Lili Hao, Weihua Yang

A graph $G$ is called $t$ -tough if $∣ S ∣ \geq t \cdot w (G - S)$ for every cutset $S$ of $G$ . ChvÃ¡tal conjectured that there exists a constant $t_{0}$ suc…

math.CO2025

2-factors in $\frac{3}{2}$ -tough maximal planar graphs

Lili Hao, Hui Ma, Songling Shan +1

The toughness of a graph $G$ is defined as the minimum value of $∣ S ∣/ c (G - S)$ over all cutsets $S$ of $G$ if $G$ is noncomplete, and is defined to be $\infty$ if $G$ is complete. Fo…

Hamiltonian cycles in 15-tough (P3​∪3P1​)-free graphs

2-factors in 23​-tough maximal planar graphs

Hamiltonian cycles in $15$ -tough ( $P_{3} \cup 3 P_{1}$ )-free graphs

2-factors in $\frac{3}{2}$ -tough maximal planar graphs