Graph Coloring Complexity

Graph Coloring Complexity is a computational complexity measure that characterizes the inherent difficulty of determining valid vertex colorings of a graph under given constraints, distinguishing it from related complexity analyses by focusing specifically on the resource requirements for solving graph coloring problems.

606

Publications

29.8K

Citations

986

Authors

486

Institutions

Publications per year

2017–2026

81

Authors

986

  1. SP
    Seth Pettie

    University of Michigan, United States

    11 publications · 414 citations

    11

    h-index

  2. DP
    Daniël Paulusma

    Durham University, United Kingdom

    12 publications · 514 citations

    11

    h-index

  3. PA
    Petr A. Golovach

    University of Bergen, Norway

    10 publications · 594 citations

    10

    h-index

  4. YC
    Yi‐Jun Chang

    University of Michigan, United States

    9 publications · 334 citations

    9

    h-index

  5. DS
    D. S. Malyshev

    National Research University Higher School of Economics, Russia

    8 publications · 169 citations

    8

    h-index

1–5 of 986

Venues

  1. Discrete Mathematics

    64 publications · 2.1K citations

    24

    h-index

  2. Discrete Applied Mathematics

    47 publications · 1.7K citations

    22

    h-index

  3. Theoretical Computer Science

    28 publications · 1.2K citations

    18

    h-index

  4. Information Processing Letters

    24 publications · 1.3K citations

    18

    h-index

  5. Journal of Combinatorial Theory Series B

    25 publications · 1.4K citations

    17

    h-index

1–5