Local Irregularity Conjecture for 2-multigraphs versus cacti
Igor Grzelec, Mariusz Wo\'zniak

TL;DR
This paper investigates the Local Irregularity Conjecture for 2-multigraphs, proving it for cacti, and discusses the minimal number of colors needed for locally irregular colorings, contributing to understanding the conjecture's validity.
Contribution
The paper proves the Local Irregularity Conjecture for cacti graphs, a significant class related to 2-multigraphs, and clarifies the minimal coloring requirements for these graphs.
Findings
The conjecture holds for cacti graphs.
Only one cactus requires 4 colors for a locally irregular coloring.
The conjecture is disproved in general, but holds for specific classes like cacti.
Abstract
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 such that every color induces a locally irregular submultigraph of . A locally irregular colorable multigraph is any multigraph which admits a locally irregular coloring. We denote by the locally irregular chromatic index of a multigraph , which is the smallest number of colors required in the locally irregular coloring of the locally irregular colorable multigraph . In case of graphs the definitions are similar. The Local Irregularity Conjecture for 2-multigraphs claims that for every connected graph , which is not isomorphic to , multigraph obtained from by doubling each edge satisfies . We show this conjecture for cacti. This class of graphs is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNuclear Receptors and Signaling · graph theory and CDMA systems
