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.
Highlights
It is a well-known fact that, in every simple graph, there have to be at least two vertices with the same degree
It is important to mention that there exist graphs for which the irregular chromatic index is not defined, that is graphs which cannot be decomposed into locally irregular subgraphs at all
We have introduced the notion of regular-irregular edge-colouring of graphs and mainly shown Theorem 17, which provides our best upper bound on the regular-irregular chromatic index of graphs
Summary
It is a well-known fact that, in every simple graph, there have to be at least two vertices with the same degree. It is important to mention that there exist graphs for which the irregular chromatic index is not defined, that is graphs which cannot be decomposed into locally irregular subgraphs at all (consider K2 for an easy example) Such graphs, said exceptional, were fully characterized in [2]. To this end, we show the NP-completeness of the problem of deciding whether a graph with a particular structure admits a particular locally irregular subgraph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Discrete Mathematics & Theoretical Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.