Edge-partitioning graphs into regular and locally irregular components

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...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Authors:	Julien Bensmail, Brett Stevens
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2016-02-01
Subjects:	regular graph locally irregular graph regular-irregular decomposition [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/2154/pdf