Vertex-disjoint cycles containing specified edges in a bipartite graph

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

Vertex-disjoint cycles containing specified edges in a bipartite graph

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	37-48
Number of pages	12
Journal	Australasian Journal of Combinatorics
Volume	23
Publication status	Published - 2001 Dec 1

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Cite this

@article{9b66cce589e94d57b403c5346d8a6ba7,

title = "Vertex-disjoint cycles containing specified edges in a bipartite graph",

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].",

author = "Guantao Chen and Hikoe Enomoto and Kawarabayashi, {Ken Ichi} and Katsuhiro Ota and Dingjun Lou and Akira Saito",

year = "2001",

month = dec,

day = "1",

language = "English",

volume = "23",

pages = "37--48",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Vertex-disjoint cycles containing specified edges in a bipartite graph

AU - Chen, Guantao

AU - Enomoto, Hikoe

AU - Kawarabayashi, Ken Ichi

AU - Ota, Katsuhiro

AU - Lou, Dingjun

AU - Saito, Akira

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=3042544964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042544964&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:3042544964

SN - 1034-4942

VL - 23

SP - 37

EP - 48

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

ER -

Vertex-disjoint cycles containing specified edges in a bipartite graph

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this