Total Coloring is a graph coloring method that assigns colors to both vertices and edges of a graph such that no two adjacent or incident elements receive the same color.
120
Publications
3.8K
Citations
218
Authors
110
Institutions
Publications per year
2017–2026
15
Parents
Publications
120
An introduction to chromatic sums
Ewa Kubicka, A. J. Schwenk · 1989 · 147 citations · Full text
On the total coloring of certain graphs
Moshe Rosenfeld · Israel Journal of Mathematics · 1971 · 142 citations
Determining the total colouring number is np-hard
Abdón Sánchez-Arroyo · Discrete Mathematics · 1989 · 126 citations
1–5 of 120
Authors
218
- JW
12
h-index
- JH
8
h-index
- ZZ
7
h-index
- GL
7
h-index
- HW
7
h-index
1–5 of 218
Institutions
110
Shandong University
Jinan, China
17 h-index
69 publications
2K citations
Zhejiang Normal University
Jinhua, China
8 h-index
16 publications
482 citations
University of Nottingham
Nottingham, United Kingdom
6 h-index
7 publications
469 citations
Lanzhou Jiaotong University
Lanzhou, China
5 h-index
18 publications
412 citations
Xidian University
Xi'an, China
4 h-index
4 publications
55 citations
National University of Singapore
Singapore, Singapore
4 h-index
6 publications
165 citations
AGH University of Krakow
Krakow, Poland
4 h-index
8 publications
90 citations
Northwest Normal University
Lanzhou, China
4 h-index
11 publications
354 citations
1–8 of 110
Venues
- Discrete Mathematics
17 publications · 601 citations
13
h-index
- Discrete Applied Mathematics
12 publications · 280 citations
11
h-index
- Journal of Combinatorial Optimization
9 publications · 310 citations
9
h-index
- Theoretical Computer Science
8 publications · 167 citations
8
h-index
- Journal of Graph Theory
6 publications · 277 citations
6
h-index
1–5