TY  - JOUR
ID  - Amar2009
LB  - Amar2009
AU  - Amar, Denise
AU  - Flandrin, Evelyne
AU  - Gancarzewicz, Grzegorz
TI  - Cyclability in bipartite graphs
ST  - Cyclability in bipartite graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2009
VL  - 29
IS  - 4
SP  - 345
EP  - 364
DO  - http://dx.doi.org/10.7494/OpMath.2009.29.4.345
UR  - http://dx.doi.org/10.7494/OpMath.2009.29.4.345
AB  - Let \(G=(X,Y,E)\) be a balanced \(2\)-connected bipartite graph and \(S \subset 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 \subset V(G)\) for the cyclability of the set \(S\).
KW  - graphs
KW  - cycles
KW  - bipartite graphs
SN  - 1232-9274
ER  -