%A Lintzmayer, Carla N.
%A Mota, Guilherme O.
%A Rocha, Lucas S. da
%A Sambinelli, Maycon
%D 2023
%T Some results on irregular decomposition of graphs
%K
%X 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.
%U https://sol.sbc.org.br/index.php/etc/article/view/24732
%J Anais do Encontro de Teoria da Computação (ETC)
%0 Journal Article
%R 10.5753/etc.2023.230304
%P 10-14%@ 2595-6116
%8 2023-08-06