Chromatic polynomials of hypergraphs

• Autorzy: Mieczysław Borowiecki , Ewa Łazuka
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

chromatic polynomial; chromatically unique hypergraphs; chromatic characterization

Kategorie tematyczne

• 05C15: Coloring of graphs and hypergraphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2000
• Tom: 20
• Numer: 2
• Strony: 293-301

Daty

wydano

2000

otrzymano

2000-10-18

Twórcy

autor

Mieczysław Borowiecki

• Institute of Mathematics, Technical University of Zielona Góra, Podgórna 50, 65-246 Zielona Góra, Poland

autor

Ewa Łazuka

• Department of Applied Mathematics, Technical University of Lublin, Bernardyńska 13, 20-950 Lublin, Poland

Bibliografia

• [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.

Identyfikatory

DOI

10.7151/dmgt.1128