Decomposing Degenerate Graphs into Locally Irregular Subgraphs

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,\dots ,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 \le 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.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2

References

  1. 1.

    Baudon, O., Bensmail, J., Hocquard, H., Senhaji, M., Sopena, É.: On locally irregular decompositions of subcubic graphs. Opus. Math. 38(6), 795–817 (2018)

    MathSciNet  Article  Google Scholar 

  2. 2.

    Baudon, O., Bensmail, J., Przybyło, J., Woźniak, M.: On decomposing regular graphs into locally irregular subgraphs. Eur. J. Combin. 49, 90–104 (2015)

    MathSciNet  Article  Google Scholar 

  3. 3.

    Baudon, O., Bensmail, J., Sopena, É.: On the complexity of determining the irregular chromatic index of a graph. J. Disc. Algorithms 30, 113–127 (2015)

    MathSciNet  Article  Google Scholar 

  4. 4.

    Bensmail, J., Merker, M., Thomassen, C.: Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Combin. 60, 124–134 (2017)

    MathSciNet  Article  Google Scholar 

  5. 5.

    Jendrol’, S., Voss, H.-J.: Light subgraphs of graphs embedded in the plane: a survey. Disc. Math. 313, 406–421 (2013)

    MathSciNet  Article  Google Scholar 

  6. 6.

    Karoński, M., Łuczak, T., Thomason, A.: Edge weights and vertex colours. J Combin Theory Ser B 91, 151–157 (2004)

    MathSciNet  Article  Google Scholar 

  7. 7.

    Lintzmayer, C.N., Mota, G.O., Sambinelli, M.: Decomposing split graphs into locally irregular graphs. Preprint. arXiv:1902.00986

  8. 8.

    Lužar, B., Przybyło, J., Soták, R.: New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Combin. Optim. 36(4), 1425–1438 (2018)

    MathSciNet  Article  Google Scholar 

  9. 9.

    Przybyło, P.: On decomposing graphs of large minimum degree into locally irregular subgraphs. Electron. J. Combin. 23(2):#P2.31 (2016)

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Julien Bensmail.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work has been supported by the French government, through the \(\hbox {UCA}^\textsc {jedi}\) Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-15-IDEX-01, by the ANR project Digraphs with the reference number ANR-19-CE48-0013, and by the STIC-AmSud Program with the project GALOP.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bensmail, J., Dross, F. & Nisse, N. Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs and Combinatorics 36, 1869–1889 (2020). https://doi.org/10.1007/s00373-020-02193-6

Download citation

Keywords

  • Locally irregular decompositions
  • Degenerate graphs
  • Cacti
  • k-trees
  • Planar graphs