Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215)
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: Chromatic number of \(P_5\)-free graphs: Reed's conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic number of \(P_5\)-free graphs: Reed's conjecture |
scientific article |
Statements
Chromatic number of \(P_5\)-free graphs: Reed's conjecture (English)
0 references
27 April 2016
0 references
chromatic number
0 references
chi-binding function
0 references
P5-free graph
0 references
Reed's conjecture
0 references
0 references
0 references
