Maximal chromatic polynomials of connected planar graphs
Ioan Tomescu · Journal of Graph Theory · 1990
Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of p ‐colorings for p ≥ 3, thus extending a previous result by the author (the case p = 3).