Kernels in edge-colored digraphs
From MaRDI portal
Publication:1584214
DOI10.1016/S0012-365X(97)00162-3zbMath0958.05061OpenAlexW2088005660MaRDI QIDQ1584214
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00162-3
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (27)
Kernels by monochromatic paths and color-perfect digraphs ⋮ On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments ⋮ Richardson's theorem in \(H\)-coloured digraphs ⋮ \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \) ⋮ 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 ⋮ \(H\)-kernels in infinite digraphs ⋮ \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem ⋮ \(\Pi\)-kernels in digraphs ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ \(k\)-colored kernels ⋮ Kernels in pretransitive digraphs. ⋮ On panchromatic digraphs and the panchromatic number ⋮ Kernels in edge-coloured orientations of nearly complete graphs ⋮ 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 and some operations in edge-coloured digraphs ⋮ Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels ⋮ \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs ⋮ On kernels by rainbow paths in arc-coloured 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: Kernels in edge-colored digraphs
