Volume 36 • Number 1 • 2013   • Vertex-Disjoint Cycles of Order Eight with Chords in a Bipartite Graph Qingsong Zou, Hongyu Chen and Guojun Li Abstract. Let $G=(V_{1},V_{2};E)$ be a bipartite graph with $\mid V_{1} \mid = \mid V_{2} \mid = 4k$, where $k$ is a positive integer. In this paper, it is proved that if the minimum degree of $G$ is at least $3k+1$, then $G$ contains $k$ vertex-disjoint cycles of order eight such that each of them has at least two chords. 2010 Mathematics Subject Classification: 05C38, 05C70 Full text: PDF