Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on adjacent vertex distinguishing total chromatic number of graphs |
scientific article |
Statements
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (English)
0 references
17 October 2017
0 references
adjacent vertex distinguishing total coloring
0 references
chromatic number
0 references
edge chromatic number
0 references
maximum degree
0 references
0 references
0 references
