Equitable Coloring

Equitable Coloring is a proper vertex coloring of a graph in which the sizes of any two color classes differ by at most one, ensuring an approximately equal distribution of colors across the vertex set.

64

Publications

1.9K

Citations

86

Authors

68

Institutions

Publications per year

2017–2026

5

Authors

86

  1. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    11 publications · 526 citations

    11

    h-index

  2. KL
    Ko‐Wei Lih

    Institute of Mathematics, Academia Sinica, Taiwan

    5 publications · 265 citations

    5

    h-index

  3. HA
    H. A. Kierstead

    Arizona State University, United States

    5 publications · 266 citations

    5

    h-index

  4. HF
    Hanna Furmańczyk

    University of Gdańsk, Poland

    4 publications · 67 citations

    4

    h-index

  5. YB
    Yuehua Bu

    Zhejiang Normal University, China

    4 publications · 94 citations

    4

    h-index

1–5 of 86

Venues

  1. Discrete Mathematics

    9 publications · 327 citations

    9

    h-index

  2. Discrete Applied Mathematics

    7 publications · 110 citations

    7

    h-index

  3. Journal of Graph Theory

    7 publications · 163 citations

    7

    h-index

  4. Theoretical Computer Science

    5 publications · 170 citations

    5

    h-index

  5. Graphs and Combinatorics

    3 publications · 64 citations

    3

    h-index

1–5