Premium
Maximal chromatic polynomials of connected planar graphs
Author(s) -
Tomescu Ioan
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140111
Subject(s) - mathematics , combinatorics , chromatic scale , planar graph , chromatic polynomial , integer (computer science) , class (philosophy) , planar , discrete mathematics , friendship graph , graph , computer science , line graph , graph power , computer graphics (images) , artificial intelligence , programming language
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).