The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
DOI10.1016/J.TCS.2015.08.016zbMATH Open1330.05065OpenAlexW1639261090MaRDI QIDQ497683FDOQ497683
Authors: Laurent Gourvès, Carlos Martinhon, Luerbio Faria, Jérôme Monnot 
Publication date: 25 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.016
Recommendations
- The edge-recoloring cost of paths and cycles in edge-colored graphs and digraphs
- Properly colored paths and cycles in edge colored graphs
- Publication:4934405
- Complexity of edge coloring with minimum reload/changeover costs
- A generalization of properly colored paths and cycles in edge-colored graphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Properly coloured cycles and paths: Results and open problems
- A polyhedral approach to edge coloring
- Edge-coloring of multigraphs: Recoloring technique
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
monochromatic pathsedge-colored graphsedge-recoloring costproperly edge-colored pathstrails and cycles
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Networks, crowds and markets. Reasoning about a highly connected world.
- Title not available (Why is that?)
- Approximation Schemes for the Restricted Shortest Path Problem
- On monochromatic paths in edge-coloured digraphs
- Hardness and inapproximability of convex recoloring problems
- Partial convex recolorings of trees and galled networks
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
- The complexity of minimum convex coloring
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- A simplified NP-complete satisfiability problem
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
- On monochromatic paths in m-coloured tournaments
- Title not available (Why is that?)
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- A note on alternating cycles in edge-coloured graphs
- Title not available (Why is that?)
- Using matrices to link conflict evolution and resolution in a graph model
- Complexity of trails, paths and circuits in arc-colored digraphs
- Paths and trails in edge-colored graphs
- Convex recoloring of paths
- On paths, trails and closed trails in edge-colored graphs
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
Cited In (1)
This page was built for publication: The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497683)
