3 research outputs found
Some results on the maximal chromatic polynomials of -connected -chromatic graphs
In 2015, Brown and Erey conjectured that every -connected graph on
vertices with chromatic number has at most
proper -colorings for all
. Engbers, Erey, Fox, and He proved this conjecture for . In this
paper, we prove Brown and Erey's conjecture under the condition that either the
clique number of is , or the independent number of is .Comment: 26 pages, 8 figures. Comments welcome