Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
DOI10.1137/120878732zbMATH Open1285.05108OpenAlexW2049630240MaRDI QIDQ5408601FDOQ5408601
Authors: James M. Carraher, Stephen G. Hartke 
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f8520ca5d7f89016213d176884654bd13e774381
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
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)
Cited In (9)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- On non-intersecting Eulerian circuits
- 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)
