A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4104988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new method to extend kernel-perfect graphs to kernel-perfect critical graphs |
scientific article; zbMATH DE number 4104988 |
Statements
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (English)
0 references
1988
0 references
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^*\).
0 references
kernel-perfect digraph
0 references
kernel-perfect critical digraph
0 references
0.9299503564834596
0 references
0.9239332675933838
0 references
0.9117602705955504
0 references
0.9094167947769164
0 references
0.8800200819969177
0 references
