On chromaticity of graphs
Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 19-31

Voir la notice de l'article provenant de la source Library of Science

In this paper we obtain the explicit formulas for chromatic polynomials of cacti. From the results relating to cacti we deduce the analogous formulas for the chromatic polynomials of n-gon-trees. Besides, we characterize unicyclic graphs by their chromatic polynomials. We also show that the so-called clique-forest-like graphs are chromatically equivalent.
Keywords: chromatic polynomial, chromatically equivalent graphs, chromatic characterization
@article{DMGT_1995_15_1_a2,
     author = {{\L}azuka, Ewa},
     title = {On chromaticity of graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {19--31},
     publisher = {mathdoc},
     volume = {15},
     number = {1},
     year = {1995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a2/}
}
TY  - JOUR
AU  - Łazuka, Ewa
TI  - On chromaticity of graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1995
SP  - 19
EP  - 31
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a2/
LA  - en
ID  - DMGT_1995_15_1_a2
ER  - 
%0 Journal Article
%A Łazuka, Ewa
%T On chromaticity of graphs
%J Discussiones Mathematicae. Graph Theory
%D 1995
%P 19-31
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a2/
%G en
%F DMGT_1995_15_1_a2
Łazuka, Ewa. On chromaticity of graphs. Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 19-31. http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a2/