On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (Q2859640)
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: On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs |
scientific article; zbMATH DE number 6230083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs |
scientific article; zbMATH DE number 6230083 |
Statements
19 November 2013
0 references
adjacent vertex-distinguishing total coloring
0 references
adjacent vertex-distinguishing total chromatic number
0 references
upper bound
0 references
On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (English)
0 references
0.9406991600990297
0 references
0.9369565844535828
0 references
0.9327802658081056
0 references
