Abstract
A k-regular bipartite graph is said to be 2-factor hamiltonian if each of its 2-factor is hamiltonian. It is well known that if a k-regular bipartite graph is 2-factor hamiltonian, then k≦3. In this paper, we give a new proof of this fact.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have