发表机构
Universidade Federal do ABC; Universidade de São Paulo; Universidade Federal de Minas Gerais(阿南格拉联邦大学; 圣保罗大学; 米纳斯吉拉斯联邦大学)
机构由 AI 辅助整理,请以论文原文为准。AI 中文总结
本文证明所有可分解图的局部不规则色指数不超过18,将此前220的界大幅改进。
AI 中文摘要
如果一个图的相邻顶点具有不同的度,则该图是局部不规则的。若图G的边集可以分解为若干局部不规则图,则称G是可分解的,其局部不规则色指数lir(G)是这种分解中所含图的最少数量。我们证明对于每个可分解图G,有lir(G)≤18,改进了此前220的界。
英文摘要
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.