Upper bound on chromatic number of square graph of sparse graphs (Q3385887)
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 7295386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bound on chromatic number of square graph of sparse graphs |
scientific article; zbMATH DE number 7295386 |
Statements
14 January 2021
0 references
\(k\)-vertex-coloring
0 references
square graph
0 references
maximum average degree
0 references
chromatic number
0 references
0.867084264755249
0 references
0.8609870076179504
0 references
0.8598122000694275
0 references
0.8439865708351135
0 references
0.8250170946121216
0 references
