Vertex Coloring

Vertex Coloring is a method in graph theory that assigns colors to the vertices of a graph such that no two adjacent vertices share the same color, thereby partitioning the vertex set into independent sets according to the coloring constraints.

1.2K

Publications

54.3K

Citations

1.7K

Authors

751

Institutions

Publications per year

2017–2026

162

Authors

1.7K

  1. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    23 publications · 1.5K citations

    18

    h-index

  2. AR
    André Raspaud

    Laboratoire Bordelais de Recherche en Informatique, France

    20 publications · 761 citations

    16

    h-index

  3. WW
    Weifan Wang

    Zhejiang Normal University, China

    13 publications · 407 citations

    13

    h-index

  4. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    13 publications · 829 citations

    13

    h-index

  5. NA
    Noga Alon

    Tel Aviv University, Israel

    14 publications · 1.4K citations

    13

    h-index

1–5 of 1.7K

Venues

  1. Discrete Mathematics

    143 publications · 5.5K citations

    37

    h-index

  2. Journal of Graph Theory

    104 publications · 4.1K citations

    32

    h-index

  3. Journal of Combinatorial Theory Series B

    63 publications · 3.5K citations

    29

    h-index

  4. Discrete Applied Mathematics

    72 publications · 2.7K citations

    29

    h-index

  5. SIAM Journal on Discrete Mathematics

    41 publications · 1.5K citations

    24

    h-index

1–5