A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099676 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extending kernel perfect digraphs to kernel perfect critical digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On kernel-perfect critical digraphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:42, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new method to extend kernel-perfect graphs to kernel-perfect critical graphs |
scientific article |
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
