On monochromatic paths and monochromatic cycles in edge coloured tournaments
From MaRDI portal
Publication:1923509
DOI10.1016/0012-365X(95)00036-VzbMath0857.05054MaRDI QIDQ1923509
Publication date: 7 October 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (31)
Kernels by monochromatic paths and color-perfect digraphs ⋮ On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments ⋮ Monochromatic sinks in \(k\)-arc colored tournaments ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Independent and monochromatic absorbent sets in infinite digraphs ⋮ New classes of panchromatic digraphs ⋮ \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph ⋮ Reachability problems in edge-colored digraphs ⋮ \(H\)-kernels in infinite digraphs ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ \(\Pi\)-kernels in digraphs ⋮ Alternating kernels ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs ⋮ On panchromatic digraphs and the panchromatic number ⋮ Restricted domination in quasi-transitive and 3-quasi-transitive digraphs ⋮ Kernels in edge-coloured orientations of nearly complete graphs ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments ⋮ Kernels by monochromatic paths in digraphs with covering number 2 ⋮ Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs ⋮ Monochromatic sinks in nearly transitive arc-colored tournaments ⋮ Kernels and some operations in edge-coloured digraphs ⋮ On kernels by rainbow paths in arc-coloured digraphs ⋮ Unnamed Item ⋮ Absorbing sets in arc-coloured tournaments ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ Kernels in edge-colored digraphs ⋮ Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments ⋮ \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs ⋮ An extension of Richardson's theorem in m-colored digraphs
Cites Work
This page was built for publication: On monochromatic paths and monochromatic cycles in edge coloured tournaments
