- Abstract:
-
An edge colouring of a graph is said to be an r-local colouring if the edges incident to any vertex are coloured with at most r colours. Generalising a result of Bessy and Thomassé, we prove that the vertex set of any 2-locally coloured complete graph may be partitioned into two disjoint monochromatic cycles of different colours. Moreover, for any natural number r, we show that the vertex set of any r-locally coloured complete graph may be partitioned into O...
Expand abstract - Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted manuscript
- Publisher:
- Wiley Publisher's website
- Journal:
- Journal of Graph Theory Journal website
- Volume:
- 81
- Issue:
- 2
- Pages:
- 134-145
- Publication date:
- 2015-04-14
- DOI:
- EISSN:
-
1097-0118
- ISSN:
-
0364-9024
- Pubs id:
-
pubs:519396
- URN:
-
uri:1bc5a925-01bb-48fb-a0af-e826bf885315
- UUID:
-
uuid:1bc5a925-01bb-48fb-a0af-e826bf885315
- Local pid:
- pubs:519396
- Keywords:
- Copyright holder:
- Wiley
- Copyright date:
- 2015
- Notes:
-
This is the author accepted manuscript following peer review version of the article. The final version is
available online from Wiley at: https://doi.org/10.1002/jgt.21867
Journal article
Monochromatic cycle partitions in local edge colorings
Actions
Authors
Bibliographic Details
Item Description
Terms of use
Metrics
Altmetrics
Dimensions
If you are the owner of this record, you can report an update to it here: Report update to this record