Absorbing sets in arc-coloured tournaments

DOI10.1016/j.disc.2003.10.024zbMath1042.05049OpenAlexW2000440641MaRDI QIDQ1827776

Pierre Ille, Geňa Hahn, Robert E. Woodrow

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.024

zbMATH Keywords

Edge-colouringTournamentMonochromatic path

Mathematics Subject Classification ID

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

Related Items (12)

A lower bound on the size of an absorbing set in an arc-coloured tournament ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Reachability problems in edge-colored digraphs ⋮ \(H\)-kernels in infinite digraphs ⋮ \(\Pi\)-kernels in digraphs ⋮ Alternating kernels ⋮ On panchromatic digraphs and the panchromatic number ⋮ Kernels in edge-coloured orientations of nearly complete graphs ⋮ Kernels by monochromatic paths in digraphs with covering number 2 ⋮ Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ An extension of Richardson's theorem in m-colored digraphs

Cites Work

• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• A Constructive Solution to a Tournament Problem

This page was built for publication: Absorbing sets in arc-coloured tournaments