Decomposing split graphs into locally irregular graphs

DOI10.1016/J.ENTCS.2019.08.053OpenAlexW2978602428WikidataQ113317376 ScholiaQ113317376MaRDI QIDQ5918672

Maycon Sambinelli, Carla Negri Lintzmayer, Guilherme Oliveira Mota

Publication date: 27 April 2022

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.053

zbMATH Keywords

split graphsgraph decompositionlocally irregular

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• Decomposing graphs into a constant number of locally irregular subgraphs
• New bounds for locally irregular chromatic index of bipartite and subcubic graphs
• On the complexity of determining the irregular chromatic index of a graph
• On decomposing regular graphs into locally irregular subgraphs
• Highly irregular graphs

This page was built for publication: Decomposing split graphs into locally irregular graphs