On complexity of colouring mixed hypertrees

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

Volumn 2138, Issue , 2001, Pages 516-524

  Král, Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; FORESTRY;

BOUNDED DEGREE; CONNECTED SUBGRAPHS; FIXED NUMBERS; HYPERGRAPH; HYPERTREES; MIXED HYPERGRAPH; TIME ALGORITHMS; VERTEX SET;

TREES (MATHEMATICS);

EID: 84974687503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_58     Document Type: Conference Paper

References (8)

1. C. Berge: Graphs and Hypergrapgs, North Holland, 1973.
2. C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6# 1, paper 25, 16 pages.
3. Ch. J. Colbourn, A. Rosa: Triple Systems, Clarendon Press, Oxford, 1999, sect. 18.6. Strict colouring and the upper chromatic number, 340–341.
4. E. Flocos: The Upper Chromatic Number of Simple Co-Monostars, Anale stiintifice ale Universitatii de Stat din Moldova, Seria Stiinte Reale, Chisinau, 1997, 22–27.
5. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: Chromatic spectrum is broken, 6th 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’, 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.
7. V. Voloshin: The mixed hypergraphs, Computer Science Journal of Moldova 1, 1993, 45–52.
8. V. Voloshin: On the upper chromatic number of a hypergraph, Australasian Journal of Combinatorics 11, 1995, 25–45.