On the existence of (k,k-1)-kernels in directed graphs
From MaRDI portal
Recommendations
Cited in
(22)- On the existence of kernels and h-kernels in directed graphs
- On the existence of 3- and 4-kernels in digraphs
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
- On the existence of \((k, l)\)-kernels in digraphs with a given circumference
- The depression of a graph and \(k\)-kernels
- Kernels of directed graph Laplacians
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Richardson's theorem for k-colored kernels in strongly connected digraphs
- On the existence and the number of (2-d)-kernels in graphs.
- On 2-dominating kernels in graphs
- A construction that preserves the number of k-kernels
- Cyclically k-partite digraphs and k-kernels
- Kernels and k-kernels in orientations of the path graph
- A sufficient condition for the existence of k-kernels in digraphs
- scientific article; zbMATH DE number 579329 (Why is no real title available?)
- scientific article; zbMATH DE number 915264 (Why is no real title available?)
- (k,)-kernels in P_m+e
- \(k\)-kernels in digraphs formed by some operations from other digraphs
- k-Kernels and some operations in digraphs
- scientific article; zbMATH DE number 2188332 (Why is no real title available?)
- The theorem of Richardson and its generalizations: a survey
- On the existence of (k,\(\ell)\)-kernels in digraphs
This page was built for publication: On the existence of \((k,k-1)\)-kernels in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534483)
