Coloring Sparse Graphs

Coloring Sparse Graphs is a research framework in graph theory that focuses on the development and analysis of algorithms for assigning colors to the vertices of sparse graphs such that adjacent vertices receive different colors, with emphasis on optimizing chromatic number and computational efficiency under structural sparsity constraints.

120

Publications

7.2K

Citations

240

Authors

146

Institutions

Publications per year

2017–2026

29

Authors

240

  1. XZ
    Xuding Zhu

    National Sun Yat-sen University, Taiwan

    7 publications · 134 citations

    7

    h-index

  2. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    7 publications · 187 citations

    7

    h-index

  3. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    7 publications · 162 citations

    7

    h-index

  4. AR
    André Raspaud

    Laboratoire Bordelais de Recherche en Informatique, France

    6 publications · 124 citations

    6

    h-index

  5. AO
    A. O. Ivanova

    North-Eastern Federal University, Russia

    6 publications · 127 citations

    6

    h-index

1–5 of 240

Venues

  1. Journal of Graph Theory

    11 publications · 226 citations

    10

    h-index

  2. Discrete Applied Mathematics

    8 publications · 141 citations

    8

    h-index

  3. Discrete Mathematics

    7 publications · 184 citations

    7

    h-index

  4. Journal of Combinatorial Theory Series B

    6 publications · 339 citations

    6

    h-index

  5. European Journal of Combinatorics

    4 publications · 91 citations

    4

    h-index

1–5