Abstract
AbstractLet G be a triangle‐free, loopless graph with maximum degree three. We display a polynomial algorithm which returns a bipartite subgraph of G containing at least ⅘ of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3‐regular, triangle‐free, loopless, connected graphs for which no bipartite subgraph has more than this proportion.
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.
