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
1.2K
Frequency assignment: Theory and applications
William K. Hale · Proceedings of the IEEE · 1980 · 1.3K citations
The strong perfect graph theorem
Maria Chudnovsky, Neil Robertson, Paul Seymour et al. · Annals of Mathematics · 2006 · 1.3K citations · Full text
Choice Reviews Online · 1995 · 1.3K citations
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
1–5 of 1.2K
1.5K
19
h-index
University of Illinois Urbana-Champaign, United States
20 publications · 1.2K citations
17
h-index
12
h-index
11
h-index
11
h-index
1–5 of 1.5K
731

Hungarian Academy of Sciences
Budapest, Hungary
23 h-index
53 publications
2.6K citations

Centre National de la Recherche Scientifique
Paris, France
21 h-index
41 publications
1.5K citations

University of Waterloo
Waterloo, Canada
19 h-index
41 publications
1.7K citations

National Sun Yat-sen University
Kaohsiung City, Taiwan
17 h-index
34 publications
942 citations
University of Illinois Urbana-Champaign
Urbana, United States
17 h-index
34 publications
1.2K citations
Princeton University
Princeton, United States
17 h-index
29 publications
2.2K citations
Charles University
Prague, Czechia
17 h-index
40 publications
1.3K citations

Sharif University of Technology
Tehran, Iran
15 h-index
32 publications
1.1K citations
1–8 of 731
205 publications · 6.6K citations
42
h-index
86 publications · 4K citations
35
h-index
80 publications · 2.5K citations
28
h-index
59 publications · 1.8K citations
25
h-index
38 publications · 2.2K citations
23
h-index
1–5