Yong Lu

activity

20152026

most citedSkew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph

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

collaborators

Showing 2026Show all

1 paper · 1 filter

math.CO2026

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

Yong Lu, Qi Wu, Qiannan Zhou

Shan~[J. Graph Theory (2026)] proved that every 23-tough $(P_{4} \cup P_{1})$ -free graph on at least three vertices is Hamiltonian. We improve this bound to 7 by replacing the final cut…

Hamiltonian cycles in 7-tough (P4​∪P1​)-free graphs

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