A locally irregular graph is a in which the end vertices of every edge have distinct degrees. coloring G any such that each colors induces subgraph G. colorable if it allows coloring. The chromatic index G, denoted by χirr′(G), smallest number used local irregularity conjecture claims all graphs, except odd-length paths, cycles and certain class cacti are three colors. As valid for graphs with ...
