Geodesic
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

DOI

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/}
}
TY  - JOUR
AU  - Berman, David M.
TI  - Critical Graphs for Acyclic Colorings
JO  - Canadian mathematical bulletin
PY  - 1978
SP  - 115
EP  - 116
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-018-x/
DO  - 10.4153/CMB-1978-018-x
ID  - 10_4153_CMB_1978_018_x
ER  - 
%0 Journal Article
%A Berman, David M.
%T Critical Graphs for Acyclic Colorings
%J Canadian mathematical bulletin
%D 1978
%P 115-116
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1978-018-x/
%R 10.4153/CMB-1978-018-x
%F 10_4153_CMB_1978_018_x

Cité par Sources :