Properly Coloured Cycles and Paths: Results and Open Problems

DOI10.1007/978-3-642-02029-2_19zbMath1194.05040MaRDI QIDQ3655153

Gregory Gutin, Eun Jung Kim

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_19

Mathematics Subject Classification ID

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

Related Items

On the maximum disjoint paths problem on edge-colored graphs, Proper Hamiltonian paths in edge-coloured multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating cycles in edge-partitioned graphs
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Hamiltonian circuits determining the order of chromosomes
• A note on alternating cycles in edge-coloured graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
• Finding paths in graphs avoiding forbidden transitions
• Minimal colorings for properly colored subgraphs
• Cycles and paths in edge‐colored graphs with given degrees
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
• Paths and Trails in Edge-Colored Graphs
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results