Disjoint quasi-kernels in digraphs
From MaRDI portal
Recommendations
Cites work
- A classification of locally semicomplete digraphs
- About quasi-kernels in a digraph
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Locally semicomplete digraphs: A generalization of tournaments
- On the number of quasi-kernels in digraphs
- On the structure of local tournaments
- Perfect graphs, kernels, and cores of cooperative games
- Quasi‐transitive digraphs
Cited in
(20)- Quasi-kernels and quasi-sinks in infinite graphs
- Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
- Kernels by properly colored paths in arc-colored digraphs
- About quasi-kernels in a digraph
- Towards the small quasi-kernel conjecture
- A note on quasi-kernels in digraphs
- Locally Semicomplete Digraphs and Generalizations
- Quasi-transitive digraphs and their extensions
- Disjoint quasi-kernels in digraphs
- At least three minimal quasi-kernels
- On the number of quasi-kernels in digraphs
- Results on the small quasi-kernel conjecture
- Algorithmic aspects of small quasi-kernels
- Quasi-kernels in split graphs
- Distant digraph domination
- A variable version of the quasi-kernel conjecture
- Compositions of digraphs: a survey
- On the small quasi-kernel conjecture -- a survey
- (k,H)-kernels in nearly tournaments
- Counterexamples to a problem of spiro on k-kernels
This page was built for publication: Disjoint quasi-kernels in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522851)