Dirac and Ore-type degree conditions are given for a bipartite graph to contain vertex disjoint cycles each of which contains a previously specified edge. This solves a conjecture of Wang in .
|Number of pages||12|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 2001 Dec 1|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics