A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
From MaRDI portal
A digraph D is said to be kernel-perfect if every induced subdigraph of D has a kernel and it is said to be kernel-perfect critical if every proper induced subdigraph of D has a kernel but D does not. In this communication it is stated that for arbitrary kernel-perfect digraph D there exists a kernel-perfect critical digraph \(D^*\) such that D is an induced subdigraph of \(D^*\).
Recommendations
Cites work
Cited in
(7)- Extending kernel perfect digraphs to kernel perfect critical digraphs
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- New classes of critical kernel-imperfect digraphs
- On a class of kernel-perfect and kernel-perfect-critical graphs
- Kernels and some operations in edge-coloured digraphs
This page was built for publication: A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121904)