Premium
Vertex‐disjoint cycles containing specified vertices in a bipartite graph
Author(s) -
Chen Guantao,
Enomoto Hikoe,
Kawarabayashi Kenichi,
Ota Katsuhiro,
Lou Dingjun,
Saito Akira
Publication year - 2004
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10159
Subject(s) - combinatorics , bipartite graph , mathematics , complete bipartite graph , edge transitive graph , vertex (graph theory) , discrete mathematics , graph power , graph , line graph
A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom