Pages that link to "Item:Q5689636"
From MaRDI portal
The following pages link to Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results (Q5689636):
Displaying 18 items.
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- Maximum colored trees in edge-colored graphs (Q2311375) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- Cycles and paths in edge‐colored graphs with given degrees (Q3055905) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)
