The necessary and sufficient condition of the irreducible paths
Zhao Hai · Journal of Northeast Normal University · 2001
Chromatic uniqueness of graphs has a close relation with irreducibility of each component of complementary graph. Let P n denote the path of n vertices. In this paper, it has shown that P n is irreducible graph if and only if n+1 is prime when n≥4 . And some new chromatically unique graphs were obtained also.