Skip to Main content Skip to Navigation
Journal articles

Edge-partitioning graphs into regular and locally irregular components

Abstract : A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs. They conjectured that for almost every graph $G$, there exists a minimum integer $\chi^{\prime}_{\mathrm{irr}}(G)$ such that $G$ admits an edge-partition into $\chi^{\prime}_{\mathrm{irr}}(G)$ classes, each of which induces a locally irregular graph. In particular, they conjectured that $\chi^{\prime}_{\mathrm{irr}}(G) \leq 3$ for every $G$, unless $G$ belongs to a well-characterized family of non-decomposable graphs. This conjecture is far from being settled, as notably (1) no constant upper bound on$\chi^{\prime}_{\mathrm{irr}}(G)$ is known for $G$ bipartite, and (2) no satisfactory general upper bound on $\chi^{\prime}_{\mathrm{irr}}(G)$ is known. We herein investigate the consequences on this question of allowing a decomposition to include regular components as well. As a main result, we prove that every bipartite graph admits such a decomposition into at most $6$ subgraphs. This result implies that every graph $G$ admits a decomposition into at most $6(\lfloor \mathrm{log} \chi (G) \rfloor +1)$ subgraphs whose components are regular or locally irregular.
Document type :
Journal articles
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01058019
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, August 16, 2016 - 4:50:25 PM
Last modification on : Thursday, September 7, 2017 - 1:03:46 AM
Long-term archiving on: : Thursday, November 17, 2016 - 10:34:13 AM

File

2770-9864-1-PB.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-01058019, version 3

Collections

Citation

Julien Bensmail, Brett Stevens. Edge-partitioning graphs into regular and locally irregular components. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.43-58. ⟨hal-01058019v3⟩

Share

Metrics

Record views

234

Files downloads

725