Paths and Trails in Edge-Colored Graphs
From MaRDI portal
Publication:5458574
DOI10.1007/978-3-540-78773-0_62zbMATH Open1136.68445OpenAlexW1878594033MaRDI QIDQ5458574FDOQ5458574
Authors:
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_62
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- The directed subgraph homeomorphism problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster scaling algorithms for general graph matching problems
- Title not available (Why is that?)
- On the Computational Complexity of Combinatorial Problems
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Alternating cycles in edge-partitioned graphs
- A note on alternating cycles in edge-coloured graphs
- Finding paths in graphs avoiding forbidden transitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Alternating paths in edge-colored complete graphs
- Hamiltonian circuits determining the order of chromosomes
- Title not available (Why is that?)
- Paths and Trails in Edge-Colored Graphs
- The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
Cited In (19)
- Paths through K-specified edges in a linear graph
- Trails in arc-colored digraphs avoiding forbidden transitions
- On paths, trails and closed trails in edge-colored graphs
- The edge-recoloring cost of paths and cycles in edge-colored graphs and digraphs
- Complexity of trails, paths and circuits in arc-colored digraphs
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Paths and trails in edge-colored weighted graphs
- On the complexity of path problems in properly colored directed graphs
- On the tractability of shortest path problems in weighted edge-coloured graphs
- Parallel connectivity in edge-colored complete graphs: complexity results
- Paths and trails in edge-colored graphs
- Symbolic coloured SCC decomposition
- On \(s\)--\(t\) paths and trails in edge-colored graphs
- Acyclicity in edge-colored graphs
- On the maximum disjoint paths problem on edge-colored graphs
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs
- Title not available (Why is that?)
- Properly coloured cycles and paths: Results and open problems
- Paths and Trails in Edge-Colored Graphs
This page was built for publication: Paths and Trails in Edge-Colored Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458574)
