" This is the first book to comprehensively cover chromatic polynomials of graphs. It includes
most of the known results and unsolved problems in the area of chromatic polynomials …

This expository paper gives a survey on most of the works done on chromatically unique
graphs that have been published since our first survey on the subject (Koh and Teo, 1990) …

Our intention is to make this bibliography as complete as possible and as such, some
marginally related references are also included. But in a work of this type, errors would …

In this paper, we describe some unsolved problems on chromatic polynomials along with a
brief account of their progresses. Most of these problems are concerned with graphs that are …

All wheels with two missing consecutive spokes are chromatically unique Page 1 ELSEVIER
Discrete Mathematics 184 (1998) 71 85 DISCRETE MATHEMATICS All wheels with two …

A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let
G be a chromatically unique graph and let Km denote the complete graph on m vertices …

This paper studies the strategy consensus problem of networked evolutionary agmes
(NEGs) under degree-based pinning control. Firstly, two necessary and sufficient conditions …

The chromatic polynomial of a graph has been widely studied in the literature. The focus of
this research is on exploring the chromatic polynomial of specific graphs that result from the …