Acyclic edge colourings of graphs with large girth
Visualitza/Obre
Cita com:
hdl:2117/134649
Tipus de documentArticle
Data publicació2016-11-03
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours. We show that for every e > 0, there exists a g = g(e) such that if G has maximum degree ¿ and girth at least g then G admits an acyclic edge colouring with (1 + e)¿+O(1) colours.
Descripció
This is the peer reviewed version of the following article: Cai, X. S., Perarnau, G. , Reed, B. and Watts, A. B. (2017), Acyclic edge colourings of graphs with large girth. Random Struct. Alg., 50: 511-533. doi:10.1002/rsa.20695, which has been published in final form at https://doi.org/10.1002/rsa.20695. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions
CitacióCai, X. [et al.]. Acyclic edge colourings of graphs with large girth. "Random structures and algorithms", 3 Novembre 2016, vol. 50, núm. 4, p. 511-533.
ISSN1042-9832
Versió de l'editorhttps://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20695
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Acyclic coloring with large girth.pdf | 336,5Kb | Visualitza/Obre |