On decomposing multigraphs into locally irregular submultigraphs

DOI10.1016/j.amc.2023.128049arXiv2208.08809OpenAlexW4366608390MaRDI QIDQ6105994

Unnamed Author, Mariusz Woźniak

Publication date: 27 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.08809

zbMATH Keywords

decomposition of graphs and multigraphslocally irregular graphs and multigraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Distance geometry (51Kxx)

Related Items (1)

Local irregularity conjecture for 2-multigraphs versus cacti

Cites Work

• Unnamed Item
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• Decomposing graphs into a constant number of locally irregular subgraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• New bounds for locally irregular chromatic index of bipartite and subcubic graphs
• Multi-set neighbor distinguishing 3-edge coloring
• A new upper bound on the game chromatic index of graphs
• Edge weights and vertex colours
• Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
• The 1-2-3 conjecture almost holds for regular graphs
• On the complexity of determining the irregular chromatic index of a graph
• On decomposing regular graphs into locally irregular subgraphs

This page was built for publication: On decomposing multigraphs into locally irregular submultigraphs