The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (Q1213881): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs |
scientific article |
Statements
The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (English)
0 references
1976
0 references
