Distance Coloring
Distance Coloring is a graph coloring method in which the assignment of colors to vertices is constrained by a specified minimum distance between vertices receiving the same color, thereby generalizing classical coloring by extending the restriction beyond adjacency to vertices at a given metric distance in the graph.
28
Publications
959
Citations
56
Authors
37
Institutions
Publications per year
2017–2026
4
Variants
Distance-k Coloring
Parents
28
Coloring unstructured wireless multi-hop networks
Johannes Schneider, Roger Wattenhofer · 2009 · 58 citations
Identifying multiple influential spreaders in term of the distance-based coloring
Lei Guo, Jianhong Lin, Qiang Guo et al. · Physics Letters A · 2015 · 56 citations
1–5 of 28
56
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 56
37
Nanjing Xiaozhuang University
Nanjing, China
3 h-index
3 publications
47 citations
University of Bergen
Bergen, Norway
2 h-index
2 publications
311 citations

Southeast University
Nanjing, China
2 h-index
4 publications
60 citations
AGH University of Krakow
Krakow, Poland
2 h-index
2 publications
34 citations

National Taiwan University
Taipei, Taiwan
1 h-index
1 publications
11 citations
Charles University
Prague, Czechia
1 h-index
2 publications
68 citations

Université de Montpellier
Montpellier, France
1 h-index
3 publications
102 citations

Durham University
Durham, United Kingdom
1 h-index
1 publications
13 citations
1–8 of 37
3 publications · 107 citations
3
h-index
2 publications · 36 citations
2
h-index
1 publications · 34 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5