Gao Mou

most citedEdge-dominating cycles, k-walks and Hamilton prisms in

2 K_{2}

-free graphs

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

collaborators

2 papers

math.CO2014★ 11 cited

Edge-dominating cycles, k-walks and Hamilton prisms in $2 K_{2}$ -free graphs

Gao Mou, Dmitrii Pasechnik

We show that an edge-dominating cycle in a $2 K_{2}$ -free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2 K_{2}$ -free graph admits a k-walk, and it can be…

math.CO2014

2-walks in 2-tough 2k2-free graphs

Gao Mou

In this paper, we prove that in every 2-tough 2 $K_{2}$ -free graph, there is a 2-walk.

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2​-free graphs

2-walks in 2-tough 2k2-free graphs

Edge-dominating cycles, k-walks and Hamilton prisms in $2 K_{2}$ -free graphs