The Local Irregularity Conjecture excluding the bow-tie graph
The Local Irregularity Conjecture excluding the bow-tie graph
Let be the bow-tie graph, and let be a connected graph that is locally irregularly colorable. Write for its locally irregular chromatic index.
Local Irregularity Conjecture. If , then
This is the improved form of the original conjecture after the bow-tie graph was found to require four colors. The source reports this as a conjecture established by Sedlar and Škrekovski, with the bound proved for cacti other than .
Sources & referencesView supporting material
Primary source
Igor Grzelec, Tomáš Madaras, Alfréd Onderko and Roman Soták, “On a new problem about the local irregularity of graphs”, arXiv:2405.13893 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.