Mixed hypercacti

Discrete Mathematics

Volumn 286, Issue 1-2, 2004, Pages 99-113

  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

Hypergraph coloring; Hypertrees; Mixed hypergraphs

Indexed keywords

COLOR; COLORING; NONLINEAR SYSTEMS; NUMBER THEORY; SET THEORY; THEOREM PROVING;

CHROMATIC NUMBERS; HYPERGRAPH COLORING; HYPERTREES; MIXED HYPERGRAPHS;

TREES (MATHEMATICS);

EID: 4344602292     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.11.051     Document Type: Conference Paper

References (13)

1. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;North-Holland, Amsterdam.
2. Chartrand G., Oellermann O.R. Applied and Algorithmic Graph Theory. 1993;McGraw-Hill, New York.
3. C. Colbourn, J. Dinitz, A. Rosa, Bicoloring triple systems. Electron. J. Combin. 6(1) (1999) paper R25 (26 pages).
4. C.J. Colbourn, A. Rosa, Strict colouring and the upper chromatic number, Triple Systems, Clarendon Press, Oxford, 1999, pp. 340-341 (Section 18.6).
5. Jiang T., Mubayi D., Tuza Zs., Voloshin V., West D.B. The chromatic spectrum of mixed hypergraphs. Graphs Combin. 18(2):2002;309-318.
6. D. Král', On complexity of colouring mixed hypertrees, Proceedings 13th International Symposium on Fundamentals of Computing Theory, 1st International Workshop on Efficient Algorithms, Lecture Notes in Computer Science, Vol. 2138, Springer, Berlin, 2001, pp. 516-524.
7. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, Proceedings 26th Workshop on Graph - Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1928, Springer, Berlin, 2000, pp. 279-289.
8. D. Král', J. Kratochvíl, H.-J. Voss, Complexity note on mixed hypergraphs, Proceedings 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 474-486.
9. J. Kratochvíl, Gap-freeness of feasible sets of mixed hypergraphs, in: J. Kára, D. Král' (Eds.), Graph Theory Day IV, KAM-DIMATIA series 2001-522, Prague, 2001, p. 11.
10. J. Kratochvíl, Z. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list coloring, in: Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197.
11. Kuratowski K. Sur le probleme des courbes gauches en topologie. Fund. Math. 15:1930;271-283.
12. Tuza Z., Voloshin V., Zhou H. Uniquely colorable mixed hypergraphs. Discrete Math. 248:2002;221-236.
13. Voloshin V. On the upper chromatic number of a hypergraph. Australas. J. Combin. 11:1995;25-45.