Vertex-dominating cycles in 2-connected bipartite graphs

Tomoki Yamashita
2007 Discussiones Mathematicae Graph Theory  
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] − 4) , then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V 1 and V 2 such that δ(G) ≥ 1 3 (max{|V 1 |, |V 2 |} + 1), then G has a vertex-dominating cycle.
doi:10.7151/dmgt.1364 fatcat:qtktpzttrne6bhyuuljwdod6ba