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 pcolorings for p 2 3, thus extending a previous result by the author (the case p = 3).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.