Premium
A sufficient condition for a bipartite graph to have a k ‐factor
Author(s) -
Enomoto Hikoe,
Ota Katsuhiro,
Kano Mikio
Publication year - 1988
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.3190120115
Subject(s) - mathematics , robertson–seymour theorem , bipartite graph , complete bipartite graph , combinatorics , edge transitive graph , discrete mathematics , graph minor , generalization , extremal graph theory , graph , pancyclic graph , voltage graph , line graph , 1 planar graph , mathematical analysis
P. Katerinis obtained a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem. We show a sufficient condition for the existence of a k ‐factor in a bipartite graph, as a generalization of Katerinis's theorem and Hall's theorem.
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