Abstract
AbstractBerge conjectured that every finite simple 4‐regular graph G contains a 3‐regular subgraph. We prove that this conjecture is true if the cyclic edge connectivity λc(G) of G is at least 10. Also we prove that if G is a smallest counterexample, then λc(G) is either 6 or 8.
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.
