Vertex-disjoint cycles containing specified edges in a bipartite graph

Guantao Chen, Hikoe Enomoto, Ken Ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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 [6].

Original languageEnglish
Pages (from-to)37-48
Number of pages12
JournalAustralasian Journal of Combinatorics
Volume23
Publication statusPublished - 2001 Dec 1

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Vertex-disjoint cycles containing specified edges in a bipartite graph'. Together they form a unique fingerprint.

  • Cite this

    Chen, G., Enomoto, H., Kawarabayashi, K. I., Ota, K., Lou, D., & Saito, A. (2001). Vertex-disjoint cycles containing specified edges in a bipartite graph. Australasian Journal of Combinatorics, 23, 37-48.