Let P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P(G,λ) = P(H,λ). We write [G] = {H∣H ∼ G}. If [G] = {G}, then G is said to be chromatically ...