Geodesic
Chromatic polynomials of hypergraphs
Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 2, pp. 293-301.

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

In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
Keywords: chromatic polynomial, chromatically unique hypergraphs, chromatic characterization 
@article{DMGT_2000_20_2_a12,
     author = {Borowiecki, Mieczys{\l}aw and {\L}azuka, Ewa},
     title = {Chromatic polynomials of hypergraphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {293--301},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2000},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a12/}
}
TY  - JOUR
AU  - Borowiecki, Mieczysław
AU  - Łazuka, Ewa
TI  - Chromatic polynomials of hypergraphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2000
SP  - 293
EP  - 301
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a12/
LA  - en
ID  - DMGT_2000_20_2_a12
ER  - 
%0 Journal Article
%A Borowiecki, Mieczysław
%A Łazuka, Ewa
%T Chromatic polynomials of hypergraphs
%J Discussiones Mathematicae. Graph Theory
%D 2000
%P 293-301
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a12/
%G en
%F DMGT_2000_20_2_a12
Borowiecki, Mieczysław; Łazuka, Ewa. Chromatic polynomials of hypergraphs. Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 2, pp. 293-301. http://geodesic.mathdoc.fr/item/DMGT_2000_20_2_a12/

[1] C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).

[2] C.Y. Chao and E.G. Whitehead Jr., On chromatic equivalence of graphs, in: Y. Alavi and D.R. Lick, eds., Theory and Applications of Graphs, Lecture Notes in Math. 642 (Springer, Berlin, 1978) 121-131, doi: 10.1007/BFb0070369.

[3] K. Dohmen, Chromatische Polynome von Graphen und Hypergraphen, Dissertation (Düsseldorf, 1993).

[4] T. Helgason, Aspects of the theory of hypermatroids, in: C. Berge and D. Ray-Chaudhuri, eds., Hypergraph Seminar, Ohio State University 1972, Lecture Notes in Mathematics 411 (Springer-Verlag, 1974) 191-213.

[5] R.P. Jones, Some results of chromatic hypergraph theory proved by 'reduction to graphs', Colloque CNRS. Problémes Combinatoires et Théorie des Graphes 260 (1976) 249-250.

[6] R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71, doi: 10.1016/S0021-9800(68)80087-0.

[7] I. Tomescu, Chromatic coefficients of linear uniform hypergraphs, J. Combin. Theory (B) 260 (1998) 229-235, doi: 10.1006/jctb.1997.1811.