Dichotomy Theorems for Generalized Chromatic Polynomials
summary
Presents dichotomy theorems classifying when generalized chromatic polynomials—extensions of the graph chromatic polynomial—are computable efficiently versus #P-hard. Uses tools from algebraic graph theory and counting complexity to identify structural conditions on graph coloring parameters that determine tractability or intractability.
AI-written summary · about