Journal article
Monochromatic cycle partitions in local edge colorings
- 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
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 278.8KB)
-
- Publisher copy:
- 10.1002/jgt.21867
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- 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
- Source identifiers:
-
519396
Item Description
- Keywords:
- Pubs id:
-
pubs:519396
- UUID:
-
uuid:1bc5a925-01bb-48fb-a0af-e826bf885315
- Local pid:
- pubs:519396
- Deposit date:
- 2016-11-24
Terms of use
- 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
If you are the owner of this record, you can report an update to it here: Report update to this record