Decomposing graphs into a constant number of locally irregular subgraphs
Authors:
- Julien BensmailJBJulien Bensmail
- Martin MerkerMMMartin Merker
- Carsten ThomassenCTCarsten Thomassen
- 1 February 2017
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 60, 124-134
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ERC Advanced Grant GRACOL (320812)
This publication has 9 references indexed in Scilit:
- The 3-flow conjecture, factors modulo k, and the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2016
- On Decomposing Graphs of Large Minimum Degree into Locally Irregular SubgraphsThe Electronic Journal of Combinatorics, 2016
- On decomposing regular graphs into locally irregular subgraphsEuropean Journal of Combinatorics, 2015
- On the complexity of determining the irregular chromatic index of a graphJournal of Discrete Algorithms, 2015
- Graph factors modulo kJournal of Combinatorial Theory, Series B, 2014
- Nowhere-zero 3-flows and modulo k-orientationsJournal of Combinatorial Theory, Series B, 2013
- The weak 3-flow conjecture and the weak circular flow conjectureJournal of Combinatorial Theory, Series B, 2012
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004