Vertex-dominating cycles in 2-connected bipartite graphs
Tomoki Yamashita
Discussiones Mathematicae Graph Theory, Tome 27 (2007), p. 323-332 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 1/3(|V(G)| - 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₁ and V₂ such that δ(G) ≥ 1/3(max{|V₁|,|V₂|} + 1), then G has a vertex-dominating cycle.

Publié le : 2007-01-01
EUDML-ID : urn:eudml:doc:270355 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1364,
     author = {Tomoki Yamashita},
     title = {Vertex-dominating cycles in 2-connected bipartite graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {27},
     year = {2007},
     pages = {323-332},
     zbl = {1133.05051},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1364}
}

Tomoki Yamashita. Vertex-dominating cycles in 2-connected bipartite graphs. Discussiones Mathematicae Graph Theory, Tome 27 (2007) pp. 323-332. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1364/

[000] [1] P. Ash and B. Jackson, Dominating cycles in bipartite graphs, in: Progress in Graph Theory, 1984, 81-87. | Zbl 0562.05032

[001] [2] D. Bauer, H.J. Veldman, A. Morgana and E.F. Schmeichel, Long cycles in graphs with large degree sum, Discrete Math. 79 (1989/90) 59-70, doi: 10.1016/0012-365X(90)90055-M.

[002] [3] J.A. Bondy, Longest paths and cycles in graphs with high degree, Research Report CORR 80-16, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada (1980). | Zbl 0409.05037

[003] [4] J.A. Bondy and G. Fan, A sufficient condition for dominating cycles, Discrete Math. 67 (1987) 205-208, doi: 10.1016/0012-365X(87)90029-X. | Zbl 0634.05045

[004] [5] R. Diestel, Graph Theory, (2nd ed.) (Springer-Verlag, 2000).

[005] [6] H.A. Jung, On maximal circuits in finite graphs, Ann. Discrete Math. 3 (1978) 129-144, doi: 10.1016/S0167-5060(08)70503-X. | Zbl 0399.05039

[006] [7] J. Moon and L. Moser, On hamiltonian bipartite graphs, Israel J. Math. 1 (1963) 163-165, doi: 10.1007/BF02759704. | Zbl 0119.38806

[007] [8] O. Ore, Note on Hamilton circuits, Amer. Math. Monthly 67 (1960) 55, doi: 10.2307/2308928.

[008] [9] A. Saito and T. Yamashita, A Note on Dominating Cycles in Tough Graphs, Ars Combinatoria 69 (2003) 3-8. | Zbl 1073.05558

[009] [10] H. Wang, On Long Cycles in a 2-connected Bipartite Graph, Graphs and Combin. 12 (1996) 373-384, doi: 10.1007/BF01858470. | Zbl 0864.05051