Skip to Main content Skip to Navigation
Journal articles

Decomposing degenerate graphs into locally irregular subgraphs

Julien Bensmail 1 François Dross 1 Nicolas Nisse 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : A (undirected) graph is locally irregular if no two of its adjacent vertices have the same degree. A decomposition of a graph G into k locally irregular subgraphs is a partition E_1,...,E_k of E(G) into k parts each of which induces a locally irregular subgraph. Not all graphs decompose into locally irregular subgraphs; however, it was conjectured that, whenever a graph does, it should admit such a decomposition into at most three locally irregular subgraphs. This conjecture was verified for a few graph classes in recent years. This work is dedicated to the decomposability of degenerate graphs with low degeneracy. Our main result is that decomposable k-degenerate graphs decompose into at most 3k+1 locally irregular subgraphs, which improves on previous results whenever k≤9. We improve this result further for some specific classes of degenerate graphs, such as bipartite cacti, k-trees, and planar graphs. Although our results provide only little progress towards the leading conjecture above, the main contribution of this work is rather the decomposition schemes and methods we introduce to prove these results.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02090804
Contributor : Julien Bensmail <>
Submitted on : Friday, April 10, 2020 - 11:55:15 AM
Last modification on : Tuesday, March 9, 2021 - 11:01:05 AM

File

irregular-degenerate.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Julien Bensmail, François Dross, Nicolas Nisse. Decomposing degenerate graphs into locally irregular subgraphs. Graphs and Combinatorics, Springer Verlag, 2020, 36 (6), pp.1869-1889. ⟨10.1007/s00373-020-02193-6⟩. ⟨hal-02090804v3⟩

Share

Metrics

Record views

93

Files downloads

89