Remarks on the local irregularity conjectureSedlar, Jelena (Avtor) Škrekovski, Riste (Avtor) locally irregular edge coloringlocal irregularity conjectureunicyclic graphcactus graphA locally irregular graph is a graph in which the end vertices of every edge have distinct degrees. A locally irregular edge coloring of a graph G is any edge coloring of G such that each of the colors induces a locally irregular subgraph of G. A graph G is colorable if it allows a locally irregular edge coloring. The locally irregular chromatic index of a colorable graph G, denoted by χ$^′_{irr}$(G), is the smallest number of colors used by a locally irregular edge coloring of G. The local irregularity conjecture claims that all graphs, except odd-length paths, odd-length cycles and a certain class of cacti are colorable by three colors. As the conjecture is valid for graphs with a large minimum degree and all non-colorable graphs are vertex disjoint cacti, we study rather sparse graphs. In this paper, we give a cactus graph B which contradicts this conjecture, i.e., χ$^′_{irr}$(B) = 4. Nevertheless, we show that the conjecture holds for unicyclic graphs and cacti with vertex disjoint cycles.20212022-05-11 14:54:07Članek v reviji136571UDK: 519.17ISSN pri članku: 2227-7390DOI: 10.3390/math9243209COBISS_ID: 93453315sl