Abstract
In this paper, a cycle is a graph in which each vertex has even degree. A Fulkerson-cover of a graph G is a set of six cycles such that each edge of G is in exactly four of the cycles. The well-known Fulkerson-Conjecture asserts that every bridgeless graph has a Fulkerson-cover. We prove that a bridgeless graph G has a Fulkerson cover if and only if there are two disjoint sets E1 and E2 of edges such that E1∪E2 is a cycle and G∖Ei has a nowhere-zero 4-flow for each i=1,2. Using this, together with a result of Jaeger related to crossing numbers, we verify the Fulkerson Conjecture for several known classes of hypohamiltonian graphs in the literatures, including the one based on flip-flops introduced by Chvátal.
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.
