On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502)
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 the D(2)-vertex distinguishing total coloring of graphs with =3 |
scientific article; zbMATH DE number 7581876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) |
scientific article; zbMATH DE number 7581876 |
Statements
On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (English)
0 references
6 September 2022
0 references
The authors consider total colorings of graphs, that is the mappings assigning a color to every edge and every vertex of a graph. Such coloring is \(D(2)\)-vertex distinguishing if it is proper and for every pair of vertices at distance \(2\) their sets of colors are distinct. It is proved in the paper that in the case of graphs satisfying \(\Delta(G)\leq 3\) it is enough to use \(11\) colors to obtain a \(D(2)\)-vertex distinguishing coloring.
0 references
total coloring
0 references
\(D(2)\)-vertex-distinguishing total coloring
0 references
\(D(2)\)-vertex-distinguishing total chromatic number
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8955535292625427
0 references
0.8867254257202148
0 references
0.8703354597091675
0 references
0.8595297932624817
0 references
