Edge-partitioning graphs into regular and locally irregular components

zbMATH Open1336.05106MaRDI QIDQ2808535FDOQ2808535

Authors: Julien Bensmail, Brett Stevens 

Publication date: 24 May 2016

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2770/0.html

Recommendations

• Decomposing graphs into a constant number of locally irregular subgraphs
• On decomposing regular graphs into locally irregular subgraphs
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• Decomposing degenerate graphs into locally irregular subgraphs
• On locally irregular decompositions of subcubic graphs

zbMATH Keywords

locally irregular graphregular graphregular-irregular decomposition

Mathematics Subject Classification ID

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

Cited In (7)

• Reversible hidden data access algorithm in cloud computing environment
• On locally irregular decompositions of subcubic graphs
• Decomposing graphs into a constant number of locally irregular subgraphs
• New bounds for locally irregular chromatic index of bipartite and subcubic graphs
• On decomposing regular graphs into locally irregular subgraphs
• Graph classes with locally irregular chromatic index at most 4
• Algorithmic complexity of weakly semiregular partitioning and the representation number

This page was built for publication: Edge-partitioning graphs into regular and locally irregular components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808535)