Name
Abstract | ||
|---|---|---|
The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We construct infinite families of graphs for which the minimum number of colors to achieve the total chromatic sum is larger than the total chromatic number. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s00373-016-1720-0 | Graphs and Combinatorics |
Keywords | Field | DocType |
Total coloring, Sum of colors, Total chromatic number | Edge coloring,Discrete mathematics,Natural number,Combinatorics,Total coloring,Fractional coloring,Vertex (geometry),Chromatic scale,Brooks' theorem,Greedy coloring,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 6 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ewa Kubicka | 1 | 66 | 9.61 |
| Grzegorz Kubicki | 2 | 95 | 15.16 |
| Maxfield Leidner | 3 | 1 | 0.69 |