Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Acyclic edge colourings of graphs with l...

Cai, Xing Shi...

Free

Share this content

Acyclic edge colourings of graphs with large girth by Cai, Xing Shi ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	12-11-2014
Summary	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 ε>0, there exists a g=g(ε) such that if G has girth at least g then G admits an acyclic edge colouring with at most (1+ε)Δ colours.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	https://arxiv.org/abs/1411.3047

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Cai, Xing Shi. Acyclic edge colourings of graphs with large girth. N.A. November 12, 2014. Accessed October 02, 2025. https://online.provdatabase.com/cite/18137

APA 7th EditionReferences

Cai, Xing Shi. (2014). Acyclic edge colourings of graphs with large girth. N.A. https://online.provdatabase.com/cite/18137

Chicago 17th EditionReferences

Cai, Xing Shi. Acyclic edge colourings of graphs with large girth. N.A. 2014. https://online.provdatabase.com/cite/18137

HarvardReferences

Cai, Xing Shi. (2014). Acyclic edge colourings of graphs with large girth. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18137. (Accessed 02 October 2025).

Harvard AustraliaReferences

Cai, Xing Shi, 2014, Acyclic edge colourings of graphs with large girth, N.A, viewed 02 October 2025, <https://online.provdatabase.com/cite/18137>

MLA 9th EditionWorks Cited

Cai, Xing Shi. Acyclic edge colourings of graphs with large girth. N.A, 2014. PROV Database, https://online.provdatabase.com/cite/18137.

Share this eBook