2022/11/15 by Igor Grzelec, Grzelec, Igor, Mariusz Woźniak +1
Engineering · Neuroscience · #05C15 #Combinatorics (math.CO) #FOS: Mathematics #Nuclear Receptors and Signaling #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2211.08270
openalex publication_date 2022/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph G such that every color induces a locally irregular submultigraph of G. A locally irregular colorable multigraph G is any multigraph which admits a locally irregular coloring. We denote by \rm lir(G) the locally irregular chromatic index of a multigraph G, which is the smallest number of colors required in the locally irregular coloring of the locally irregular colorable multigraph G. In case of graphs the definitions are similar. The Local Irregularity Conjecture for 2-multigraphs claims that for every connected graph G, which is not isomorphic to K2, multigraph 2G obtained from G by doubling each edge satisfies \rm lir(2G)≤ 2. We show this conjecture for cacti. This class of graphs is important for the Local Irregularity Conjecture for 2-multigraphs and the Local Irregularity Conjecture which claims that every locally irregular colorable graph G satisfies \rm lir(G)≤ 3. At the beginning it has been observed that all not locally irregular colorable graphs are cacti. Recently it has been proved that there is only one cactus which requires 4 colors for a locally irregular coloring and therefore the Local Irregularity Conjecture was disproved.