论文信息 - IN BIPARTITE GRAPHS

IN BIPARTITE GRAPHS

Let G = (X, Y ; E) be a balanced 2-connected bipartite graph and S ⊂ V(G). We will say that S is cyclable in G if all vertices of S belong to a common cycle in G. We give sufficient degree conditions in a balanced bipartite graph G and a subset S ⊂ V(G) for the cyclability of the set S.

Denise Amar | Evelyne Flandrin | Grzegorz Gancarzewicz

[1] William Dodd McCuaig,et al. Cycles and connectivity in graphs , 1983 .

[2] Hao Li,et al. A Note on a Generalisation of Ore’s Condition , 2005, Graphs Comb..

[3] Denise Amar,et al. Cyclability and pancyclability in bipartite graphs , 2001, Discret. Math..

[4] J. Moon,et al. On Hamiltonian bipartite graphs , 1963 .

[5] Ronghua Shi,et al. 2-neighborhoods and Hamiltonian Conditions , 1992, J. Graph Theory.

[6] John Adrian Bondy,et al. A method in graph theory , 1976, Discret. Math..

[7] Paul Erdös,et al. A note on Hamiltonian circuits , 1972, Discret. Math..

[8] Katsuhiro Ota,et al. Cycles through prescribed vertices with large degree sum , 1995, Discret. Math..

[9] Zdenek Ryjácek,et al. Cycles through given vertices and closures , 2004, Discret. Math..