Repository logo

Browsing by Subject "cycles"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Cyclability in bipartite graphs
    (2009) Amar, Denise; Flandrin, Evelyne; Gancarzewicz, Grzegorz
    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$.