Abstract
AbstractA 2‐factor in a graph is a subset of edges such that every node of is incident with exactly two edges of . Many results are known concerning 2‐factors including a polynomial‐time algorithm for finding 2‐factors and a characterization of those graphs that have a 2‐factor. The problem of finding a 2‐factor in a graph is a relaxation of the NP‐hard problem of finding a Hamilton cycle. A stronger relaxation is the problem of finding a triangle‐free 2‐factor, that is, a 2‐factor whose edges induce no cycle of length 3. In this paper, we present a polynomial‐time algorithm for the problem of finding a triangle‐free 2‐factor as well as a characterization of the graphs that have such a 2‐factor and related min–max and augmenting path theorems.
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.
