On a Total Version of 1-2-3 Conjecture
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction. In this paper, we focus on the one by the full sum of colors of a verte...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2020-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2223 |