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

Authors

56

  1. WD
    Wei Dong

    Beijing Institute of Technology, China

    3 publications · 47 citations

    3

    h-index

  2. ZS
    Zdzisław Skupień

    AGH University of Krakow, Poland

    2 publications · 34 citations

    2

    h-index

  3. FM
    Fredrik Manne

    University of Bergen, Norway

    2 publications · 311 citations

    2

    h-index

  4. WL
    Wensong Lin

    Southeast University, China

    2 publications · 30 citations

    2

    h-index

  5. GJ
    Gerard J. Chang

    National Yang Ming Chiao Tung University, Taiwan

    2 publications · 21 citations

    2

    h-index

1–5 of 56

Venues

  1. Discrete Mathematics

    3 publications · 107 citations

    3

    h-index

  2. Journal of Combinatorial Optimization

    2 publications · 36 citations

    2

    h-index

  3. SIAM Journal on Discrete Mathematics

    1 publications · 34 citations

    1

    h-index

  4. SIAM Journal on Scientific Computing

    1 publications · 13 citations

    1

    h-index

  5. 1

    h-index

1–5