TY - JOUR
AU - Lintzmayer, Carla N.
AU - Mota, Guilherme O.
AU - Rocha, Lucas S. da
AU - Sambinelli, Maycon
PY - 2023/08/06
TI - Some results on irregular decomposition of graphs
JF - Anais do Encontro de Teoria da Computação (ETC); 2023: Anais do VIII Encontro de Teoria da ComputaçãoDO - 10.5753/etc.2023.230304
KW -
N2 - A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph G is a decomposition of G into subgraphs that are locally irregular. We prove that any graph G can be decomposed into at most 2∆(G) − 1 locally irregular graphs, improving on the previous upper bound of 3∆(G)−2. We also show some results on subcubic and non-decomposable graphs.
UR - https://sol.sbc.org.br/index.php/etc/article/view/24732