Name
Abstract | ||
|---|---|---|
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1,..., k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.7151/dmgt.1909 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
general edge coloring,total coloring,neighbor-distinguishing index,neighbor sum distinguishing coloring | Discrete mathematics,Complete coloring,Combinatorics,Total coloring,Fractional coloring,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 1 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evelyne Flandrin | 1 | 219 | 25.13 |
| Hao Li | 2 | 53 | 6.03 |
| Antoni Marczyk | 3 | 0 | 0.34 |
| Jean-François Saclé | 4 | 43 | 7.05 |
| Mariusz Woźniak | 5 | 204 | 34.54 |