On monochromatic paths in m-coloured tournaments
From MaRDI portal
Publication:1108286
DOI10.1016/0095-8956(88)90059-7zbMath0654.05033OpenAlexW2045621845MaRDI QIDQ1108286
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90059-7
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (37)
Kernels by monochromatic paths and color-perfect digraphs ⋮ A lower bound on the size of an absorbing set in an arc-coloured tournament ⋮ 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 ⋮ \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph ⋮ Reachability problems in edge-colored digraphs ⋮ \(H\)-kernels in infinite digraphs ⋮ On monochromatic paths and monochromatic cycles in edge coloured tournaments ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ Domination in transitive colorings of tournaments ⋮ \(\Pi\)-kernels in digraphs ⋮ Alternating kernels ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ \(k\)-colored kernels ⋮ On panchromatic digraphs and the panchromatic number ⋮ Kernels in edge-coloured orientations of nearly complete graphs ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ A new generalization of kernels in 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 ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture ⋮ A counterexample to a conjecture on edge-coloured tournaments ⋮ Absorbing sets in arc-coloured tournaments ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ Tournaments and Semicomplete Digraphs ⋮ 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 in m-coloured tournaments
