Abstract
Abstract Moon and Moser (Israel J. Math. 1 (1962) 163–165) showed that if G is a balanced bipartite graph of order 2 n and minimum degree σ ⩾ ( n + 1)/2, then G is hamiltonian. Recently, it was shown that their well-known degree condition also implies the existence of a 2-factor with exactly k cycles provided n ⩾ max {52, 2 k 2 + 1}. In this paper, we show that a similar degree condition implies that for each perfect matching M , there exists a 2-factor with exactly k cycles including all edges of M .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
