Study on the vertices chromatic conjecture of the graph
Lin Yu-qing · Journal of Anhui University · 2007
In 1968,Lovasz gave the conjecture: if the graph G is not complete,and χ(G)=m+n-1,here m≥2 and n≥2,then there exists two disjoint subgraph G1 and G2 of G,such that χ(G1)=m and χ(G2)=n.In the parer,we give a example to prove the conjecture is not ture,and then give the sufficient condition that the conjecture is ture.