Extremal properties of the chromatic polynomials of connected 3-chromatic graphs

Authors

  • Ioan Tomescu University of Bucharest, Faculty of Mathematics, Str. Academiei 14, 70109 Bucuresti, Romania Author

Keywords:

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

Subjects:

05C15

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$.

Downloads

Published

2001-10-15

Issue

Vol. 53 No. 3–4 (2001): Vol. 53, Issue 3–4

Section

Articles

License

Copyright (c) 2001 Authors retain copyright to their work.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.