An upper bound for the total chromatic number of dense graphs (Q4013421): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:50, 6 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound for the total chromatic number of dense graphs |
scientific article |
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