Abstract
AbstractLet M be a matching in a graph G such that d(x) + d(y) ≥ |G| for all pairs of independent vertices x and y of G that are incident with M. We determine a necessary and sufficient condition for M to be contained in a cycle of G. This extends results of Häggkvist and Berman, and implies that if M is a 1‐factor of G and |G| 0 (mod 4), then M is contained in a Hamilton cycle of G. We use our results to deduce that an eulerian graph of minimum degree 2k contains k pairwise compatible Euler tours.
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.
