A sufficient condition for a graph to contain three disjoint 1-factors |
| |
Authors: | Sein Win |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|