Premium
A sufficient condition for a graph to contain three disjoint 1‐factors
Author(s) -
Win Sein
Publication year - 1982
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.3190060413
Subject(s) - combinatorics , mathematics , hamiltonian path , disjoint sets , graph , pancyclic graph , discrete mathematics , line graph , 1 planar graph
Ore derived a sufficient condition for a graph to contain a Hamiltonian cycle. We obtain a sufficient condition, similar to Ore's condition, for a graph to contain a Hamiltonian cycle and a 1‐factor which are edge disjoint.