Abstract

In an edge-colored graph, we say that a path is alternating if it has at least three vertices and any two adjacent edges have different colors. Deciding whether or not there exist two disjoint alternating paths between two vertices in edge-colored graphs is NP-complete. In this work, we study the existence of alternating paths between vertices by restricting ourselves to the case of edge-colored complete graphs. We first solve the “vertex-disjoint” version of this problem and related questions for edge-colored complete graphs. We next give efficient algorithms for finding a fixed number of pairwise vertex- or edge-disjoint paths each of which has given extremities. Related problems are proposed.

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.