MATEMATIČKI VESNIK
МАТЕМАТИЧКИ ВЕСНИК



MATEMATIČKI VESNIK
Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
Ioan Tomescu

Abstract

In this paper the greatest $\lceil n/2\rceil$ values of $P(G;3)$ in the class of connected 3-chromatic graphs $G$ of order $n$ are found, where $P(G;\lambda)$ denotes the chromatic polynomial of~$G$.

Creative Commons License

Keywords: Chromatic polynomial, connected 3-chromatic graph, 3-color partition, skeleton of a graph.

MSC: 05C15

Pages:  111$-$116     

Volume  53 ,  Issue  3$-$4 ,  2001