Kernels by monochromatic paths and the color-class digraph
From MaRDI portal
Publication:3089352
Recommendations
Cited in
(20)- Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
- An extension of Richardson's theorem in m-colored digraphs
- \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
- Richardson's theorem in \(H\)-coloured digraphs
- Kernels by monochromatic paths and color-perfect digraphs
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
- \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
- On kernels by monochromatic paths in \(D\)-join.
- Kernels in edge-coloured orientations of nearly complete graphs
- Kernels in edge-colored digraphs
- \(H\)-kernels in infinite digraphs
- Monochromatic kernel-perfectness of special classes of digraphs
- Independent and monochromatic absorbent sets in infinite digraphs
- Kernels in monochromatic path digraphs
- scientific article; zbMATH DE number 5551581 (Why is no real title available?)
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- Monochromatic directed walks in arc-colored directed graphs
This page was built for publication: Kernels by monochromatic paths and the color-class digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089352)
