An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (Q2926811)
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 of the adjacent-vertex-strong-distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6363881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6363881 |
Statements
3 November 2014
0 references
adjacent-vertex-strong-distinguishing total coloring
0 references
adjacent-vertex-strong-distinguishing total chromatic number
0 references
Lovász local lemma
0 references
An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (English)
0 references
