On decomposing regular graphs into locally irregular subgraphs
Authors:
- O. BaudonOBO. Baudon
- J. BensmailJBJ. Bensmail
- J. PrzybyłoJPJ. Przybyło
- M. WoźniakMWM. Woźniak
- 1 October 2015
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 49, 90-104
Abstract
No abstract availableKeywords
Funding Information
- National Science Centre, Poland (2014/13/B/ST1/01855, DEC-2013/09/B/ST1/01772)
- Polish Ministry of Science and Higher Education
This publication has 15 references indexed in Scilit:
- A New Upper Bound for the Irregularity Strength of GraphsSIAM Journal on Discrete Mathematics, 2011
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Degree constrained subgraphsDiscrete Applied Mathematics, 2008
- Vertex-Colouring Edge-WeightingsCombinatorica, 2007
- Vertex colouring edge partitionsJournal of Combinatorial Theory, Series B, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- On graph irregularity strengthJournal of Graph Theory, 2002
- On the independence and chromatic numbers of random regular graphsJournal of Combinatorial Theory, Series B, 1992
- Irregular Assignments of Trees and ForestsSIAM Journal on Discrete Mathematics, 1990
- Highly irregular graphsJournal of Graph Theory, 1987