Premium
Two sufficient conditions for a 2‐factor in a bipartite graph
Author(s) -
Katerinis P.
Publication year - 1987
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.3190110102
Subject(s) - bipartite graph , complete bipartite graph , mathematics , combinatorics , edge transitive graph , robertson–seymour theorem , discrete mathematics , graph , foster graph , pancyclic graph , voltage graph , line graph , 1 planar graph
In this paper we prove that every 1‐tough bipartite graph which is not isomorphic to K 1,1 has a 2‐factor. We also obtain a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem.