Infinite kernel perfect digraphs
From MaRDI portal
Publication:2409759
Recommendations
- Some sufficient conditions for the existence of kernels in infinite digraphs
- Richardson's theorem in quasi-transitive and pre-transitive digraphs
- Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Kernels in infinite digraphs
Cites work
- Graphes Noyau-Parfaits
- scientific article; zbMATH DE number 988853 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Kernels in directed graphs: A poison game
- Kernels in infinite digraphs
- Kernels in pretransitive digraphs.
- Kernels in quasi-transitive digraphs
- On kernel-perfect critical digraphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Quasi-kernels and quasi-sinks in infinite graphs
- Recent problems and results about kernels in directed graphs
- Solutions of irreflexive relations
Cited in
(9)- Some sufficient conditions for the existence of kernels in infinite digraphs
- Quasi-kernels and quasi-sinks in infinite graphs
- Kernels in pretransitive digraphs.
- Kernels of digraphs with finitely many ends
- Richardson's theorem in quasi-transitive and pre-transitive digraphs
- scientific article; zbMATH DE number 3929034 (Why is no real title available?)
- Extensions of Richardson's theorem for infinite digraphs and \((\mathscr{A} , \mathscr{B} )\)-kernels
- Kernels in infinite digraphs
- Poison game for semikernels of arbitrary digraphs
This page was built for publication: Infinite kernel perfect digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409759)