Kernels in infinite digraphs
From MaRDI portal
Recommendations
Cited in
(24)- Some sufficient conditions for the existence of kernels in infinite digraphs
- Quasi-kernels and quasi-sinks in infinite graphs
- Kernels in a special class of digraphs
- Kernels of digraphs with finitely many ends
- H-kernels by walks in an \(R_H (D)\) digraph
- Infinite kernel perfect digraphs
- Kernels in weighted digraphs
- Kernels in quasi-transitive digraphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- scientific article; zbMATH DE number 3891402 (Why is no real title available?)
- scientific article; zbMATH DE number 4212085 (Why is no real title available?)
- Extending digraphs to digraphs with (without) \(k\)-kernel
- \(H\)-kernels in infinite digraphs
- scientific article; zbMATH DE number 3929034 (Why is no real title available?)
- scientific article; zbMATH DE number 1275896 (Why is no real title available?)
- Kernels in digraphs that are not kernel perfect
- Semicomplete absorbent sets in digraphs
- Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
- Kernels in circulant digraphs
- \(H\)-kernels by walks in subdivision digraph
- Restricted reachability in infinite digraphs
- Kernels in digraphs with colored vertices
- \(\Pi\)-kernels in digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
This page was built for publication: Kernels in infinite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547543)