An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550)
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 improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6856476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs |
scientific article; zbMATH DE number 6856476 |
Statements
An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (English)
0 references
5 April 2018
0 references
adjacent vertex distinguishing total coloring
0 references
maximum degree
0 references
0.95788836479187
0 references
0.9377482533454896
0 references
0.9369565844535828
0 references
0.9118431806564332
0 references
