Cyclability in bipartite graphs

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz
2009 Opuscula Mathematica  
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.
doi:10.7494/opmath.2009.29.4.345 fatcat:uyod4rajafap3bmrmrbpgczjua