Abstract
A trigraph is a multigraph with half-edges colored in three colors. We introduce the notion of an Eulerian coloring of a trigraph and show that the existence of two orthogonal Eulerian colorings in a special class of trigraphs is closely related to the bipartizing matchings conjecture of Fleischner, and hence to the cycle double cover conjecture and Tutte’s 5-flow conjecture. We prove that every trigraph has an Eulerian coloring and that a rainbow cubic trigraph has a pair of orthogonal Eulerian colorings if and only if it has a perfect matching.
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.
