On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735)
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: On the chromatic number of H-free graphs of large minimum degree |
scientific article; zbMATH DE number 5999864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the chromatic number of \(H\)-free graphs of large minimum degree |
scientific article; zbMATH DE number 5999864 |
Statements
On the chromatic number of \(H\)-free graphs of large minimum degree (English)
0 references
24 January 2012
0 references
Minimum degree conditions
0 references
\(H\)-Free graphs
0 references
0 references
0.8674434423446655
0 references
0.8476660251617432
0 references
0.8286469578742981
0 references
0.8144263029098511
0 references
0.8079926371574402
0 references
