Complexity note on mixed hypergraphs

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

Volumn 2136, Issue , 2001, Pages 474-485

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; POLYNOMIAL APPROXIMATION;

CHROMATIC NUMBER; FEASIBLE SET; MAXIMUM DEGREE; MIXED HYPERGRAPH; POLYNOMIAL-TIME ALGORITHMS; PROPER COLORING; UPPER CHROMATIC NUMBER; VERTEX COLORING;

GRAPH THEORY;

EID: 84974715308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_42     Document Type: Conference Paper

References (13)

1. C. Berge: Graphs and Hypergraphs, North Holland, 1973.
2. C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Elect ronic J. Combin. 6# 1, paper 25,16 pages.
3. Ch. J. Colbourn, A. Rosa: Triple Systems, Claren don Press, Oxford, 1999, sect. 18.6. Strict colouring and the upper chromatic number, 340-341.
4. T. Etzion and A. Hartman: Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math. 4 (1991),182-195.
5. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: Chromatic spectrum is broken,6t h Twente Workshop on Graphs and Combinatorial Optimization, 26-28, May, 1999, H. J. Broersma,U. Faigle and J. L. Hurink (eds.), University of Twente, May,1999, 231-234.
6. D. Král’: On Complexity of Colouring Mixed Hypertrees, to appear in Proccedings 13th International Symposium on Fundamentals of Computing Theory, 1 st International Workshop on Efficient Algorithms, LNCS, 2001.
7. D. Král’: On Feasible Sets of Mixed Hypergraphs, in preparation.
8. D. Král’, J. Kratochvíl, A. Proskurowski, H.-J. Voss: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS vol. 1928, 2000, p. 279-289.
9. H. Lefmann, V. Rödland, R. Thomas: Monochromatic vs. multicolored paths, Graphs Combin. 8 (1992),323-332.
10. L. Milazzo: On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania,1995), 179-193.
11. L. Milazzo and Zs. Tuza: Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997), 247-259.
12. L. Milazzo and Zs. Tuza: Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998),233-243.
13. V. Voloshin: The mixed hypergraphs,C omputer Science Journal of Moldova 1, 1993,45-52.