Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863)
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: Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree |
scientific article; zbMATH DE number 6691082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree |
scientific article; zbMATH DE number 6691082 |
Statements
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (English)
0 references
3 March 2017
0 references
chromatic number
0 references
triangle-free graph
0 references
induced subgraph
0 references
forbidden subgraph
0 references
0.9664335250854492
0 references
0.9199495315551758
0 references
0.823589026927948
0 references
0.8219978213310242
0 references
