A bound of the vertex-distinguishing total chromatic number of graphs (Q2886306)
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: A bound of the vertex-distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6041066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound of the vertex-distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6041066 |
Statements
1 June 2012
0 references
vertex-distinguishing total coloring
0 references
vertex distinguishing total chromatic number
0 references
the Lovász local lemma
0 references
0.9784864
0 references
0.9678608
0 references
0.9548689
0 references
0.9519526
0 references
0.94850564
0 references
0.94755626
0 references
0.94343936
0 references
0.9405832
0 references
A bound of the vertex-distinguishing total chromatic number of graphs (English)
0 references
