Chromatic polynomials of hypergraphs

Mieczysław Borowiecki; Ewa Łazuka

Discussiones Mathematicae Graph Theory (2000)

  • Volume: 20, Issue: 2, page 293-301
  • ISSN: 2083-5892

Abstract

top
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.

How to cite

top

Mieczysław Borowiecki, and Ewa Łazuka. "Chromatic polynomials of hypergraphs." Discussiones Mathematicae Graph Theory 20.2 (2000): 293-301. <http://eudml.org/doc/270182>.

@article{MieczysławBorowiecki2000,
abstract = {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.},
author = {Mieczysław Borowiecki, Ewa Łazuka},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {chromatic polynomial; chromatically unique hypergraphs; chromatic characterization; hypergraph; chromatically unique; hypertree},
language = {eng},
number = {2},
pages = {293-301},
title = {Chromatic polynomials of hypergraphs},
url = {http://eudml.org/doc/270182},
volume = {20},
year = {2000},
}

TY - JOUR
AU - Mieczysław Borowiecki
AU - Ewa Łazuka
TI - Chromatic polynomials of hypergraphs
JO - Discussiones Mathematicae Graph Theory
PY - 2000
VL - 20
IS - 2
SP - 293
EP - 301
AB - 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.
LA - eng
KW - chromatic polynomial; chromatically unique hypergraphs; chromatic characterization; hypergraph; chromatically unique; hypertree
UR - http://eudml.org/doc/270182
ER -

References

top
  1. [1] C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973). 
  2. [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. [3] K. Dohmen, Chromatische Polynome von Graphen und Hypergraphen, Dissertation (Düsseldorf, 1993). 
  4. [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. [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. [6] R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71, doi: 10.1016/S0021-9800(68)80087-0. Zbl0173.26203
  7. [7] I. Tomescu, Chromatic coefficients of linear uniform hypergraphs, J. Combin. Theory (B) 260 (1998) 229-235, doi: 10.1006/jctb.1997.1811. Zbl0914.05024

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.