One Means of Constructing K-Chromatically Critical Graphs
Xuefen Li · Journal of Langfang Teachers College · 2009
The chromatic number χ(G) of graph G is the least color number k if its vertices can be colored with k colors so that no two adjacent vertices have the same color.G is said to be k-critical graph if χ(H)χ(G)=k for every proper subgraph H of G.In this paper,one means of constructing k-chromatically critical graphs is gived.