Decomposing graphs into a constant number of locally irregular subgraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2017

Decomposing graphs into a constant number of locally irregular subgraphs

Résumé

A graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index chi_irr'(G) of a graph G is the smallest number of locally irregular subgraphs needed to edge-decompose G. Not all graphs have such a decomposition, but Baudon, Bensmail, Przybyło, and Woźniak conjectured that if G can be decomposed into locally irregular subgraphs, then chi_irr'(G)⩽3. In support of this conjecture, Przybyło showed that chi_irr'(G)⩽3 holds whenever G has minimum degree at least 10^10. Here we prove that every bipartite graph G which is not an odd length path satisfies chi_irr'(G)⩽10. This is the first general constant upper bound on the irregular chromatic index of bipartite graphs. Combining this result with Przybyło's result, we show that chi_irr'(G)⩽328 for every graph G which admits a decomposition into locally irregular subgraphs. Finally, we show that chi_irr'(G)⩽2 for every 16-edge-connected bipartite graph G.
Fichier principal
Vignette du fichier
LocIrr0709.pdf (268.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01629938 , version 1 (07-11-2017)

Identifiants

Citer

Julien Bensmail, Martin Merker, Carsten Thomassen. Decomposing graphs into a constant number of locally irregular subgraphs. European Journal of Combinatorics, 2017, 60, pp.124 - 134. ⟨10.1016/j.ejc.2016.09.011⟩. ⟨hal-01629938⟩
207 Consultations
119 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More