REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
Vizing conjectured [9] that, for edge- -critical graph with nvertices, where is the independence number of G. In this remark, we show that for is maximum degree of And for let denote the number of vertices of degree i. Then we give a short proof of the following statement: if Gis a 4-critical graph with or then
independent number, edge chromatic number, critical graph.