An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs |
scientific article |
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
