An upper bound for the total chromatic number of dense graphs (Q4013421)
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: An upper bound for the total chromatic number of dense graphs |
scientific article; zbMATH DE number 64301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the total chromatic number of dense graphs |
scientific article; zbMATH DE number 64301 |
Statements
An upper bound for the total chromatic number of dense graphs (English)
0 references
27 September 1992
0 references
upper bound
0 references
dense graphs
0 references
total chromatic number
0 references
0.8778648376464844
0 references
0.8748839497566223
0 references
0.8716938495635986
0 references
