Coloring mixed hypertrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1928, Issue , 2000, Pages 279-289

  Král, Daniel ^a   Kratochvíl, Jan ^a   Proskurowski, Andrzej ^b   Voss, Heinz Jürgen ^c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OREGON   (United States)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHROMATIC SPECTRUM; CONTINUOUS SPECTRUM; HYPER GRAPH; MIXED HYPERGRAPH; POLYNOMIALLY SOLVABLE; STRICT COLORINGS; UPPER CHROMATIC NUMBER; VERTEX COLORING;

GRAPH THEORY;

EID: 77955706284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40064-8_26     Document Type: Conference Paper

References (11)

1. R. Ahlswede, Coloring hypergraphs: a new approach to multi-user source coding, I and II, Journal of Combinatorics, Information, and System Sciences 4 (1979), 76-115, and 5 (1980), 220-268.
2. E. Bulgaru and V. Voloshin, Mixed interval hypergraphs, Discrete Applied Math. 77 (1997), 24-41.
3. T. Etzion and A. Hartman, Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math. 4 (1991), 182-195.
4. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D.B. West, The chromatic spectrum of mixed hypergraphs, submitted
5. H. Lefmann, V. Rödl, and R. Thomas, Monochromatic vs. multicolored paths, Graphs Combin. 8 (1992), 323-332.
6. L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania, 1995), 179-193.
7. L. Milazzo and Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247-259.
8. L. Milazzo and Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998), 233-243.
9. Zs. Tuza and V. Voloshin, Uncolorable mixed hypergraphs, Discrete Applied Math., (to appear).
10. V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Comb. 11 (1995), 25-45.
11. V. Voloshin, Mixed hypergraphs as models for real problems, (in preparation)