Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-25T08:17:15.654Z Has data issue: false hasContentIssue false
  • English
  • Français

An acyclic analogue to Heawood's theorem

Published online by Cambridge University Press:  18 May 2009

Michael O. Albertson  and
David M. Berman
Michael O. Albertson
Affiliation:
Department Of Mathematics, Smith College, Northampton, Mass. 01063
David M. Berman
Affiliation:
Department of Mathematics, University of New Orleans, New Orleans, La. 70122
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The concept of acyclic coloring was introduced by Grünbaum [5] and is a generalization of point arboricity.

A proper k-coloring of the vertices of a graph Gis said to be acyclic if G contains no two-colored cycle. The acyclic chromatic number of a graph G, denoted by a(G), is the minimum value of k for which G has an acyclic k-coloring. Let a(n) denote the maximum value of the acyclic chromatic number among all graphs of genus n. In [5], Grünbaum conjectured that a(0) = 5 and proved that a(0)≤9. The conjecture was proved by Borodin [3] after the upper bound was improved three times in [7], [1] and [6]. In [2], we proved that a(1)≤a(0) + 3. The purpose of this paper is to prove the following

Theorem. Any graph of genus n>0 can be acyclically colored with 4n + 4 colors.

It is not known for any n>0 whether a(n)>H(n), the Heawood number [8].

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 19 , Issue 2 , July 1978 , pp. 163 - 166
Copyright
Copyright © Glasgow Mathematical Journal Trust 1978

References

REFERENCES

1.Albertson, M. O. and Berman, D. M., Every planar graph has an acyclic 7-coloring, Israel J. Math., 28 (1977), 169–174.CrossRefGoogle Scholar
2.Albertson, M. O. and Berman, D. M., The acyclic chromatic number, Proc. 1th S-E Conf. Combinatorics, Graph Theory, and Computing (Utilitas Math., 1976), 51–60.Google Scholar
3.Borodin, O. V., A proof of B. Grünbaum's conjecture on the acyclic 5-colorability of planar graphs (Russian), Dokl. Akad. Nauk SSSR 231 (1976), 18–20.Google Scholar
4.Brooks, R. L., On coloring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941), 194–197.CrossRefGoogle Scholar
5.Griinbaum, B., Acyclic colorings of planar graphs, Israel J. Math. 14 (1973), 390–408.Google Scholar
6.Kostochka, A. V., Acyclic 6-coloring of planar graphs (Russian), Diskret. Analiz. 28 (1976), 40.Google Scholar
7.Mitchem, J., Every planar graph has an acyclic 8-coloring, Duke Math. J. 41 (1974), 177–181.CrossRefGoogle Scholar
8.Ringel, G., Map Color Theorem (Springer, 1974).CrossRefGoogle Scholar