Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: bounded degree graph

Sortuj według:

Ogranicz wyniki do:

Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree

100%

Fiedorowicz A.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 1

91-99

A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, every cycle in G has at least three distinct colours. Acyclic colourings were introduced by Gr¨unbaum in 1973, and since then have been widely studied. In particular, the problem of acyclic colourings of graphs with bounded maximum degree has been investigated. In 2011, Kostochka and Stocker showed that any graph with maximum degree 5 can be acyclically coloured with at most 7 colours. The question, whether this bound is achieved, remains open. In this note we prove that any graph with maximum degree 5 and maximum average degree at most 4 admits an acyclic 6-colouring. We also provide examples of graphs with these properties.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Fiedorowicz A.

1 2013

Wyniki wyszukiwania

Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree