Autor:	BORODIN, O. V., KOSTOCHKA, A. V., WOODALL, D. R.
Předmět:	GRAPH coloring GRAPH theory NUMBER theory MATHEMATICAL proofs MATHEMATICAL analysis ALGEBRAIC cycles
Zdroj:	Journal of the London Mathematical Society; 10/01/1999, Vol. 60 Issue 2, p344-352, 9p
Abstrakt:	A proper vertex-colouring of a graph is acyclic if there are no 2-coloured cycles. It is known that every planar graph is acyclically 5-colourable, and that there are planar graphs with acyclic chromatic number Ça = 5 and girth g = 4. It is proved here that a planar graph satisfies Ça d 4 if g e 5 and Ça d 3 if g e 7. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Plný text