An introduction to chromatic polynomials

1968/01/01 by Ronald C. Read · 8 citations
Decision Sciences · Engineering · Mathematics · #Algebra over a field #Artificial intelligence #Chromatic scale #Combinatorics #Computer science #Mathematics #Operations Management Techniques #Optimization and Mathematical Programming #Optimization and Packing Problems #Orthogonal polynomials #Pure mathematics #Salient

paper · pdf · doi:10.1016/s0021-9800(68)80087-0

crossref issued 1968/01/01 · crossref published 1968/01/01 · crossref published-print 1968/01/01 · openalex publication_date 1968/01/01 · crossref created 2007/12/01 · crossref deposited 2025/09/19 · openalex created_date 2025/10/10 · crossref indexed 2026/08/02 · openalex updated_date 2026/08/02

Citations

• The Reducibility of Maps
• A Determinant Formula for the Number of Ways of Coloring a Map

Cited by

• On maximally saturated graphs
• On chordal graphs and their chromatic polynomials
• Catalan, Motzkin, and Riordan numbers
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Chromatic Roots are Dense in the Whole Complex Plane
• Chromatic polynomial [wikipedia]
• Component (graph theory) [wikipedia]