Acyclic edge colourings of graphs with large girth

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat Politècnica de Catalunya > Documents de recerca > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/134649

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
dc.contributor.author	Cai, Xing Shi
dc.contributor.author	Perarnau Llobet, Guillem
dc.contributor.author	Reed, Bruce
dc.contributor.author	Watts, Adam Bene
dc.date	2016-11-03
dc.identifier.citation	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.
dc.identifier.citation	1042-9832
dc.identifier.citation	10.1002/rsa.20695
dc.identifier.uri	http://hdl.handle.net/2117/134649
dc.language.iso	eng
dc.relation	https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20695
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Graph theory
dc.subject	Grafs, Teoria de
dc.title	Acyclic edge colourings of graphs with large girth
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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
dc.description.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.

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

How to determine if a random graph with a fixed degree sequence has a giant component

Joos, Felix; Perarnau Llobet, Guillem; Rautenbach, Dieter; Reed, Bruce

An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs

Abiad, Aida; Fiol Mora, Miquel Àngel; Haemers, Willem H.; Perarnau Llobet, Guillem

Decomposition of bounded degree graphs into C4-free subgraphs

Kang, Ross; Perarnau Llobet, Guillem

Large subgraphs without short cycles

Foucaud, Florent; Krivelevich, Michael; Perarnau Llobet, Guillem

Fast recoloring of sparse graphs

Bousquet, Nicolas; Perarnau Llobet, Guillem

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio