H-kernels in H-colored digraphs without ( _1 , , _2 )-H-subdivisions of C₃
From MaRDI portal
Publication:2139807
Recommendations
Cites work
- scientific article; zbMATH DE number 1153462 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A dichotomy for the kernel by H‐walks problem in digraphs
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Kernels by monochromatic paths and the color-class digraph
- Kernels by properly colored paths in arc-colored digraphs
- Kernels in edge-colored digraphs
- Kernels in pretransitive digraphs.
- Monochromatic cycles and monochromatic paths in arc-colored digraphs
- On monochromatic paths in edge-coloured digraphs
- Reachability problems in edge-colored digraphs
- Restricted domination in arc-colored digraphs
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs
Cited in
(10)- -panchromatic digraphs
- On the existence of kernels and \(h\)-kernels in directed graphs
- $H$-kernels in $H$-colored digraphs without $(\xi_{1}, \xi, \xi_{2})$-$H$-subdivisions of $\overrightarrow{C_{3}}$
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- \(H\)-kernels by walks in subdivision digraph
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
- \(H\)-kernels in infinite digraphs
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
This page was built for publication: \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139807)