H-kernels by walks in an R_H (D) digraph
From MaRDI portal
Publication:2176159
Recommendations
Cites work
- scientific article; zbMATH DE number 3891402 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1944416 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Kernels and some operations in edge-coloured digraphs
- Kernels in infinite digraphs
- On monochromatic paths in edge-coloured digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Reachability problems in edge-colored digraphs
- \(H\)-kernels by walks in subdivision digraph
Cited in
(9)- -panchromatic digraphs
- \(H\)-kernels in infinite digraphs
- H-kernels by walks
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- Independent restricted domination and the line digraph
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- \(H\)-kernels by walks in subdivision digraph
- Primitive Lie PI-algebras
- A dichotomy for the kernel by H‐walks problem in digraphs
This page was built for publication: H-kernels by walks in an \(R_H (D)\) digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176159)