Abstract

Two Euler tours of a graph G are compatible if no pair of adjacent edges of G are consecutive in both tours. Bill Jackson recently gave a good characterization of those 4-regular graphs which contain three pairwise compatible Euler tours. In this paper we give a solution by means of a polynomial-time algorithm, and we give a min-max relation generalizing Jackson's theorem. The solution uses the theory of isotropic systems by replacing Euler tours by supplementary Eulerian vectors.

Full Text
Paper version not known

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 call

Disclaimer: 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.