Chromatic Polynomials

Chromatic Polynomials is a mathematical function in algebraic graph theory that assigns to each graph a polynomial whose value at a positive integer k counts the number of proper vertex colorings of the graph using at most k colors, distinguished by its foundational role in relating graph coloring to polynomial enumeration via the inclusion-exclusion principle.

1.2K

Publications

50.2K

Citations

1.5K

Authors

731

Institutions

Publications per year

2017–2026

109

Authors

1.5K

  1. XZ
    Xuding Zhu

    National Sun Yat-sen University, Taiwan

    33 publications · 1K citations

    19

    h-index

  2. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    20 publications · 1.2K citations

    17

    h-index

  3. WT
    W. T. Tutte

    University of Waterloo, Canada

    12 publications · 1.6K citations

    12

    h-index

  4. PS
    Paul Seymour

    Princeton University, United States

    14 publications · 1.9K citations

    11

    h-index

  5. OV
    O. V. Borodin

    Sobolev Institute of Mathematics, Russia

    11 publications · 774 citations

    11

    h-index

1–5 of 1.5K

Venues

  1. Discrete Mathematics

    205 publications · 6.6K citations

    42

    h-index

  2. Journal of Combinatorial Theory Series B

    86 publications · 4K citations

    35

    h-index

  3. Journal of Graph Theory

    80 publications · 2.5K citations

    28

    h-index

  4. Discrete Applied Mathematics

    59 publications · 1.8K citations

    25

    h-index

  5. COMBINATORICA

    38 publications · 2.2K citations

    23

    h-index

1–5