Abstract
A spanning circuit in a graph is defined as a closed trail visiting each vertex of the graph. A compatible spanning circuit in an edge-colored graph refers to a spanning circuit in which each pair of edges traversed consecutively along the spanning circuit has distinct colors. As two extreme cases, sufficient conditions for the existence of compatible Hamilton cycles and compatible Euler tours have been obtained in previous literature. In this paper, we first establish sufficient conditions for the existence of compatible spanning circuits visiting each vertex exactly k times, for every feasible integer k, in edge-colored complete graphs and complete equipartition r-partite graphs. We also provide sufficient conditions for the existence of compatible spanning circuits visiting each vertex v at least ⌊(d(v)−1)∕2⌋ times in edge-colored graphs satisfying Ore-type degree conditions.
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.
