Graph Coloring

Graph Coloring is a combinatorial optimization problem in which the vertices of a graph are assigned colors such that no two adjacent vertices share the same color, distinguishing it from related graph partitioning problems by its focus on minimizing the number of colors used.

4.8K

Publications

212.3K

Citations

5.4K

Authors

1.7K

Institutions

Publications per year

2017–2026

592

Authors

5.4K

  1. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    70 publications · 3K citations

    30

    h-index

  2. NA
    Noga Alon

    Tel Aviv University, Israel

    49 publications · 5.2K citations

    30

    h-index

  3. XZ
    Xuding Zhu

    National Sun Yat-sen University, Taiwan

    68 publications · 2.3K citations

    27

    h-index

  4. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    47 publications · 2.7K citations

    27

    h-index

  5. AG
    András Gyárfás

    Hungarian Academy of Sciences, Hungary

    40 publications · 1.7K citations

    24

    h-index

1–5 of 5.4K

Venues

  1. Discrete Mathematics

    479 publications · 15.5K citations

    59

    h-index

  2. Journal of Combinatorial Theory Series B

    225 publications · 12K citations

    57

    h-index

  3. Journal of Graph Theory

    317 publications · 10.8K citations

    47

    h-index

  4. Discrete Applied Mathematics

    228 publications · 7.6K citations

    45

    h-index

  5. COMBINATORICA

    98 publications · 6.3K citations

    41

    h-index

1–5