Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs. (Q2804813)
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: Upper bounds on the D()-vertex-distinguishing total-chromatic number of graphs. |
scientific article; zbMATH DE number 6577893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs. |
scientific article; zbMATH DE number 6577893 |
Statements
4 May 2016
0 references
random coloring
0 references
probability method
0 references
positive probability
0 references
\(D(\beta)\)-vertex-distinguishing total-chromatic number
0 references
Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs. (English)
0 references
0.8938381671905518
0 references
0.8788936734199524
0 references
0.8748530149459839
0 references
0.8725818395614624
0 references
0.8580913543701172
0 references
