Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three

DOI10.1137/140992850zbMath1355.05149OpenAlexW2585453630MaRDI QIDQ2960471

Stephen G. Hartke, James M. Carraher

Publication date: 9 February 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6cddf402a521286e92840b80d5490c0662c4106a

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)

Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

Cites Work

• Matroid matching and some applications
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Hamiltonicity of digraphs for universal cycles of permutations
• Matching, Euler tours and the Chinese postman
• Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
• On Unicursal Paths in a Network of Degree 4
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three