The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7333534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices |
scientific article; zbMATH DE number 7333534 |
Statements
The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (English)
0 references
15 April 2021
0 references
chromatic number
0 references
triangle-free graph
0 references
broom-free graph
0 references
0 references
0 references
0.9248697757720948
0 references
0.9199495315551758
0 references
0.8252994418144226
0 references
0.8137582540512085
0 references
