Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees

Discrete Mathematics

Volumn 309, Issue 22, 2009, Pages 6391-6401

  Bujtás, Csilla ^a   Tuza, Zsolt ^a,b  

^a UNIVERSITY OF PANNONIA   (Hungary)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Chromatic spectrum; Circular hypergraph; Feasible set; Hypertree; Interval hypergraph; Mixed hypergraph; Vertex coloring

Indexed keywords

CHROMATIC SPECTRUM; CIRCULAR HYPERGRAPH; FEASIBLE SET; HYPERTREE; INTERVAL HYPERGRAPH; MIXED HYPERGRAPH; VERTEX COLORING;

COLOR; COLORING; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; SET THEORY;

GRAPH THEORY;

EID: 70350787051     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.10.023     Document Type: Article

References (15)

1. Drgas-Burchardt E., and Łazuka E. On chromatic polynomials of hypergraphs. Applied Mathematics Letters 20 12 (2007) 1250-1254
2. Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, I: General results, Discrete Mathematics, in press (doi:10.1016/j.disc.2008.04.019)
3. Bujtás Cs., and Tuza Zs. Mixed colorings of hypergraphs. Electronic Notes in Discrete Mathematics 24 (2006) 273-275
4. Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Manuscript, 2008
5. Bulgaru E., and Voloshin V. Mixed interval hypergraphs. Discrete Applied Mathematics 77 (1997) 29-41
6. Jiang T., Mubayi D., Tuza Zs., Voloshin V.I., and West D. The chromatic spectrum of mixed hypergraphs. Graphs and Combinatorics 18 (2002) 309-318
7. Král' D. On feasible sets of mixed hypergraphs. The Electronic Journal of Combinatorics 11 1 (2004) R19, 14 pp
8. Král' D., Kratochvíl J., and Voss H.-J. Mixed hypercacti. Discrete Mathematics 286 (2004) 99-113
9. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Proc. 26th Workshop on Graph-Theoretic Concepts in Computer Science, in: Lecture Notes in Computer Science, vol. 1928, Springer-Verlag, 2000, pp. 279-289; Discrete Applied Mathematics 154 (2006) 660-672
10. Lovász L. Coverings and colorings of hypergraphs. Congressus Numerantium 8 (1973) 3-12
11. Tuza Zs., Voloshin V., and Zhou H. Uniquely colorable mixed hypergraphs. Discrete Mathematics 248 (2002) 221-236
12. Voloshin V. The mixed hypergraphs. Computer Science Journal of Moldova 1 (1993) 45-52
13. Voloshin V. On the upper chromatic number of a hypergraph. Australasian Journal of Combinatorics 11 (1995) 25-45
14. V. Voloshin, H.-J. Voss, Circular mixed hypergraphs I: Colorability and unique colorability, in: Proc. of the Thirty-first Southeastern International Conference on Combinatorics, in: Graph Theory and Computing (Boca Raton, FL, 2000), Congressus Numerantium, 144, (2000), 207-219
15. Voloshin V., and Voss H.-J. Circular mixed hypergraphs II: The upper chromatic number. Discrete Applied Mathematics 154 (2006) 1157-1172