Cyclability in bipartite graphs
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz · Opuscula Mathematica · 2009
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.