On monochromatic paths in edge-coloured digraphs
From MaRDI portal
Publication:1165860
DOI10.1016/0095-8956(82)90047-8zbMath0488.05036OpenAlexW2041862945MaRDI QIDQ1165860
Bill Sands, Norbert W. Sauer, Robert E. Woodrow
Publication date: 1982
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(82)90047-8
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (71)
Infinite quasi-transitive digraphs with domination number 2 ⋮ 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 ⋮ Richardson's theorem in \(H\)-coloured digraphs ⋮ On panchromatic patterns ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ Covering with Euclidean boxes ⋮ \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \) ⋮ Monochromatic sinks in \(k\)-arc colored tournaments ⋮ H-kernels by walks ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Independent and monochromatic absorbent sets in infinite digraphs ⋮ New classes of panchromatic digraphs ⋮ H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. ⋮ \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph ⋮ Reachability problems in edge-colored digraphs ⋮ On monochromatic paths in m-coloured tournaments ⋮ \(H\)-kernels in infinite digraphs ⋮ \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem ⋮ H-kernels by walks in an \(R_H (D)\) digraph ⋮ On monochromatic paths and monochromatic cycles in edge coloured tournaments ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ Domination in transitive colorings of tournaments ⋮ Unions of digraphs which become kernel perfect ⋮ Richardson's theorem in quasi-transitive and pre-transitive digraphs ⋮ \(\Pi\)-kernels in digraphs ⋮ Alternating kernels ⋮ On a lemma of Scarf. ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ \(k\)-colored kernels ⋮ Kernels in pretransitive digraphs. ⋮ Kernels in weighted 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 ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Kernels by properly colored paths in arc-colored digraphs ⋮ Domination in tournaments ⋮ A Richardson's theorem version for \(\Pi\)-kernels ⋮ 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 in quasi-transitive digraphs ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels ⋮ On weighted kernels of two posets. ⋮ $H$-kernels by walks in subdivision digraph ⋮ \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs ⋮ Domination in Digraphs ⋮ On kernels by rainbow paths in arc-coloured digraphs ⋮ Unnamed Item ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture ⋮ Kernels in some orientations of comparability graphs ⋮ A counterexample to a conjecture on edge-coloured tournaments ⋮ Absorbing sets in arc-coloured tournaments ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ On s-t paths and trails in edge-colored graphs ⋮ 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 ⋮ New sufficient conditions for the existence of kernels in digraphs ⋮ Kernel perfect and critical kernel imperfect digraphs structure ⋮ On Ramsey-Turán type problems in tournaments ⋮ An extension of Richardson's theorem in m-colored digraphs ⋮ Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
Cites Work
This page was built for publication: On monochromatic paths in edge-coloured digraphs
