Critical \((P_5,\mathit{dart})\)-free graphs (Q6606249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Critical \((P_5,\mathit{dart})\)-free graphs |
scientific article; zbMATH DE number 7914118
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical \((P_5,\mathit{dart})\)-free graphs |
scientific article; zbMATH DE number 7914118 |
Statements
Critical \((P_5,\mathit{dart})\)-free graphs (English)
0 references
16 September 2024
0 references
graph coloring
0 references
\(k\)-critical graphs
0 references
strong perfect graph theorem
0 references
polynomial-time algorithms
0 references
