Indexed metadata
An 18-colour bound for locally irregular decompositions
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli, Vinicius Fernandes dos Santos
Source abstract
A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally irregular chromatic index lir(G) is the least number of graphs in such a decomposition. We prove that lir(G) <= 18 for every decomposable graph G, improving the previous bound of 220.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.