On total colourings of graphs (Q2277476)
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 4195985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On total colourings of graphs |
scientific article; zbMATH DE number 4195985 |
Statements
On total colourings of graphs (English)
0 references
1993
0 references
We show that as \(n\to \infty\) the proportion of graphs on vertices 1,2,...,n with total chromatic number \(\chi ''>\Delta +1\) is very small; and the proportion with \(\chi ''>\Delta +2\) is very very small. Here \(\Delta\) denotes the maximum vertex degree. We also give an easy new deterministic upper bound on \(\chi ''\) (proved randomly).
0 references
total colouring
0 references
random graph
0 references
0.9117372632026672
0 references
0.9117372632026672
0 references
0.8781271576881409
0 references
0.8751211166381836
0 references
