Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments

DOI10.1007/s00373-005-0618-zzbMath1075.05033OpenAlexW2397412345MaRDI QIDQ2573805

Hortensia Galeana-Sánchez, Rocío Rojas-Monroy

Publication date: 24 November 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0618-z

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Monochromatic sinks in \(k\)-arc colored tournaments ⋮ Domination in transitive colorings of tournaments ⋮ Alternating kernels ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments ⋮ Monochromatic sinks in nearly transitive arc-colored tournaments ⋮ Unnamed Item ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture

Cites Work

• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Kernels in edge-colored digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Recent problems and results about kernels in directed graphs
• Kernels in the closure of coloured digraphs
• Unnamed Item

This page was built for publication: Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments