Chromaticity of some families of dense graphs

For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of G. If [G]={G}, then G is said to be chromatically unique. In this paper, we

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
• Keywords: Chromatic Equivalence Class, Chromatic Polynomial, DM 2002, ÿrst Determine