Parallel connectivity in edge-colored complete graphs: complexity results
From MaRDI portal
Publication:6154375
DOI10.1007/S00373-023-02747-4OpenAlexW4391716630MaRDI QIDQ6154375FDOQ6154375
Publication date: 15 February 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02747-4
Cites Work
- Color-coding
- On the Complexity of Timetable and Multicommodity Flow Problems
- Title not available (Why is that?)
- On the Computational Complexity of Combinatorial Problems
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Maximum colored trees in edge-colored graphs
- Title not available (Why is that?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Cycles and paths in edge‐colored graphs with given degrees
- Graph folding and programmable logic array
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Paths and trails in edge-colored graphs
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- 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?)
- Alternating Hamiltonian cycles
- Links in edge-colored graphs
- The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
This page was built for publication: Parallel connectivity in edge-colored complete graphs: complexity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154375)
