Critical Graphs for Acyclic Colorings
Canadian mathematical bulletin, Tome 21 (1978) no. 1, pp. 115-116
Voir la notice de l'article provenant de la source Cambridge University Press
The concept of acyclic colorings of graphs, introduced by Grunbaum [2], is a generalization of point-arboricity. An acyclic coloring of a graph is a proper coloring of its points such that there is no two-colored cycle. We denote by a(G), the acyclic chromatic number of a graph G, the minimum number of colors for an acyclic coloring of G. We call G k-critical if a(G) = fc but a(G′) for any proper subgraph G′. For all notation and terminology not defined here, see Harary [3].
Berman, David M. Critical Graphs for Acyclic Colorings. Canadian mathematical bulletin, Tome 21 (1978) no. 1, pp. 115-116. doi: 10.4153/CMB-1978-018-x
@article{10_4153_CMB_1978_018_x,
author = {Berman, David M.},
title = {Critical {Graphs} for {Acyclic} {Colorings}},
journal = {Canadian mathematical bulletin},
pages = {115--116},
year = {1978},
volume = {21},
number = {1},
doi = {10.4153/CMB-1978-018-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-018-x/}
}
[1] 1. B. Bollobás and Harary, F., Point arboricity critical graphs exist, J. London Math. Soc. (2), 12 (1975), 97-102. Google Scholar
[2] 2. Griinbaum, B., “Acyclic colorings of planar graphs”, Israel. J. Math., 14 (1973), 390-408. Google Scholar
[3] 3. Harary, F., Graph Theory (Addison-Wesley, Reading, Mass., 1969). Google Scholar
[4] 4. Kronk, H. V. and Mitchem, J., Critical point-arboritic graphs, J. London Math. Soc. (2), 9 (1975), 459-466. Google Scholar
Cité par Sources :