Title of article
Mixed colorings of hypergraphs
Author/Authors
Ilona Baracska and Bujtلs، نويسنده , , Csilla and Tuza، نويسنده , , Zsolt، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
273
To page
275
Abstract
We generalize the concept of the colorings of mixed hypergraphs to ‘mixed colorings’ of hypergraphs. The idea is to put lower and upper bounds on the number of colors assigned to the vertices in each edge. Some earlier results can be extended for our model, too, while some others — e.g., concerning time complexity — change in a significant way.
Keywords
Hypergraph , Chromatic polynomial , Vertex coloring , feasible set , mixed hypergraph , unique colorability , gap in the chromatic spectrum , perfect hypergraph , hypertree , interval hypergraph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454314
Link To Document