Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs

DOI10.1137/120878732zbMath1285.05108OpenAlexW2049630240MaRDI QIDQ5408601

Stephen G. Hartke, James M. Carraher

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

zbMATH Keywords

Eulerian circuitcompatible circuitno monochromatic transitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Edge-disjoint rainbow spanning trees in complete graphs ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

This page was built for publication: Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs