Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
From MaRDI portal
Publication:5408601
Recommendations
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Note on edge-colored graphs and digraphs without properly colored cycles
- On even circuit decompositions of eulerian graphs
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
- Circuit decompositions of Eulerian graphs
- Monochromatic cycle partitions of edge-colored graphs
Cited in
(9)- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- On non-intersecting Eulerian circuits
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Edge-disjoint rainbow spanning trees in complete graphs
- Compatible spanning circuits in edge-colored graphs
- Compatible spanning circuits and forbidden induced subgraphs
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
This page was built for publication: Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408601)
