Alternating Cycles and Paths in Edge-Coloured Multigraphs
Jørgen Bang‐Jensen, Gregory Gutin · University of Southern Denmark Research Portal (University of Southern Denmark) · 1994
A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs. We also show useful connections between the theory of paths and cycles in bipartite digraphs and the theory of alternating paths and cycles in edge-coloured graphs.