On weakly ordered systems

Cited in

(27)

Some sufficient conditions for the existence of kernels in infinite digraphs
On kernel-perfect critical digraphs
Extending kernel perfect digraphs to kernel perfect critical digraphs
Towards the small quasi-kernel conjecture
Perfect graphs with polynomially computable kernels
On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
On the complexity of the 3-kernel problem in some classes of digraphs
On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
Über die Bestimmung von Kernen in endlichen Graphen
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
On a Theorem of Richardson
Domination in digraphs
New sufficient conditions for the existence of kernels in digraphs
Kernel perfect and critical kernel imperfect digraphs structure
scientific article; zbMATH DE number 3706478 (Why is no real title available?)
scientific article; zbMATH DE number 3771630 (Why is no real title available?)
Finding kernels or solving SAT
scientific article; zbMATH DE number 3573900 (Why is no real title available?)
scientific article; zbMATH DE number 1444491 (Why is no real title available?)
On the kernel and related problems in interval digraphs
Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
A study on token digraphs
A variable version of the quasi-kernel conjecture
The theorem of Richardson and its generalizations: a survey
Kernels in digraphs with colored vertices
On kernels and semikernels of digraphs

This page was built for publication: On weakly ordered systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5834632)