Kernels in edge-colored digraphs
From MaRDI portal
Recommendations
- Kernels in edge-coloured orientations of nearly complete graphs
- Kernels by monochromatic directed paths in m-colored digraphs with quasi-transitive chromatic classes.
- Kernels in edge coloured line digraph
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- Kernels by monochromatic paths and the color-class digraph
Cites work
Cited in
(44)- Kernels in pretransitive digraphs.
- Alternating kernels
- Kernels by properly colored paths in arc-colored digraphs
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On kernels by rainbow paths in arc-coloured digraphs
- \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
- \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- An extension of Richardson's theorem in m-colored digraphs
- Kernels in weighted digraphs
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- Kernels in the closure of coloured digraphs
- Kernels by monochromatic paths and color-perfect digraphs
- Kernels by monochromatic directed paths in m-colored digraphs with quasi-transitive chromatic classes.
- On monochromatic paths and bicolored subdigraphs in arc-colored tournaments
- Richardson's theorem in \(H\)-coloured digraphs
- Kernels by monochromatic directed paths in 3-colored tournaments and quasi-tournaments
- Kernels by monochromatic paths and the color-class digraph
- 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
- Monochromatic paths on edge colored digraphs and state splittings
- \(H\)-kernels in infinite digraphs
- Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs
- Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
- Kernels in edge coloured line digraph
- \(k\)-colored kernels
- On panchromatic digraphs and the panchromatic number
- Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
- A new generalization of kernels in digraphs
- King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
- Kernels and cycles' subdivisions in arc-colored tournaments
- Kernels by monochromatic paths in digraphs with covering number 2
- Kernels in monochromatic path digraphs
- The theorem of Richardson and its generalizations: a survey
- A (2 + ) k-vertex kernel for the dual coloring problem
- \(\Pi\)-kernels in digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
- Kernels in edge-coloured orientations of nearly complete graphs
- On kernels by monochromatic paths in the corona of digraphs
- Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs
- Kernels and some operations in edge-coloured digraphs
This page was built for publication: Kernels in edge-colored digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584214)
