Abstract
In 1957, Kotzig proved that the line graph of a snark (non edge-3-colorable cubic graph) is a 4-coloring-snark (non edge-4-colorable 4-regular graph). In this paper we present a reverse construction, i.e., we construct snarks from 4-coloring-snarks. In a similar way, we construct graphs without nowhere-zero 3-flows from snarks.
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.
