The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (Q1213881): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5603088 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4074931 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of perfect graphs / rank | |||
Normal rank | |||
Latest revision as of 15:00, 12 June 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
