Uniquely colorable mixed hypergraphs

Discrete Mathematics

Volumn 248, Issue 1-3, 2002, Pages 221-236

  Tuza, Zsolt ^a   Voloshin, Vitaly ^b   Zhou, Huishan ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Algorithmic complexity; Coloring; Lower (upper) chromatic number; Mixed hypergraphs; Unique colorability

Indexed keywords

EID: 31244437259     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00176-5     Document Type: Article

References (36)

1. R. Ahlswede, Coloring hypcrgraphs: a new approach to multi-user source coding, Part I, J. Combinatorics, Inform. System Sci. 4 (I) (1979) 76-115; Part II: 5 (3) (1980) 220-268.
2. K. Appel, W. Haken, Every planar map is four colorable, Part I: discharging, Illinois J. Math. 21 (1997) 429-490.
3. K. Appel, W. Haken, J. Koch, Every planar map is four colorable, Part II: reducibility, Illinois J. Math. 21 (1997) 491-567.
4. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
5. A.E. Brouwer, J.B. Shearer, N.J.A. Sloane, W.D. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory IT-36 (1990) 1334-1380.
6. E. Bulgaru, V. Voloshin, Mixed interval hypcrgraphs, Discrete Appl. Math. 77 (1997) 29-41.
7. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
8. T. Etzion, A. Hartman, Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math. 4 (1991) 182-195.
9. E. Flocos, The upper chromatic number of simple co-monostars, Anale stiintifice ale USM, Stiinte reale, Chisinau, 1997, pp. 22-27.
10. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complcte graph problems, Theoret. Comput. Sci. l (1976) 237-267.
11. D. Greenwell, L. Lovász, Applications of product coloring, Acta Math. Acad. Sci. Hungar. 25 (1994) 335-340.
12. A. Hajnal, J. Surdnyi, Über die Auflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest Eötvös Sect. Math, l (1958) 113-121.
13. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley Interscience, New York, 1995.
14. T. Jiang, D. Mubayi, New upper bounds for a canonical Ramsey problem, Combinatorica, to appear.
15. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. West, The chromatic spectrum of mixed hypergraphs, Graphs Combin., to appear.
16. J. Kratochvil, Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. 50 (1994) 297-302.
17. J. Kratochvil, Zs. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list colorings, in: R.L. Graham et al. (Eds.), Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, Vol. 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197.
18. H. Lefmann, V. Rödl, R. Thomas, Monochromatic vs multicolored paths, Graphs Combin. 8 (1992) 323-332.
19. L. Lovâsz. Coverings and colorings of hypergraphs, Congr. Num. 8 (1973) 3-12.
20. D. Lozovanu, V. Voloshin, Integer programming models for colorings of mixed hypergraphs, Comput. Sci. J. Moldova 8 (1)(22) (2000) 64-74.
21. L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L-Fasc. I (1995) 179-193.
22. L. Milazzo, The monochromatic block number, Discrete Math. 165-166 (1997) 487-196.
23. L. Milazzo, Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math. 174 (1997) 247-259.
24. L. Milazzo, Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math. 182 (1998) 233-243.
25. A. Niculitsa, V. Voloshin, About uniquely colorable mixed hypertrees, Discuss. Math. Graph Theory 20 (1) (2000) 81-91.
26. A. Niculitsa, H.-J. Voss, A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n -I and n -2. Austral. J. Combin. 21 (2000) 167-177.
27. V. Prisakaru, The upper chromatic number of quasi-interval co-hypergraphs, Le Matematiche LII-Fasc. II (1997) 237-260.
28. Zs. Tuza, Graph colorings with local constraints-a survey, Discuss. Math. Graph Theory 17 (2) (1997) 161-228.
29. Zs. Tuza, V. Voloshin, Uncolorable mixed hypergraphs, Discrete Appl. Math. 99 (2000) 209-227.
30. V. Voloshin. Properties of triangulated graphs, Issledovanie operatsii i programmirovanie, Kishinev, Stiinta, 1982, pp. 24-32 (in Russian).
31. V. Voloshin, The mixed hypergraphs, Comput. Sci. J. Moldova 1 (1993) 45-52.
32. V. Voloshin, On the upper chromatic number of a hypergraph, Austral. J. Combin. 11 (1995) 25-45.
33. V. Voloshin, Mixed hypergraphs as models for real problems, in preparation.
34. V. Voloshin, H.-J. Voss, Circular mixed hypergraphs I: colorability and unique colorability, Congr. Numer. 144 (2000) 207-219.
35. V. Voloshin, H. Zhou, Pseudo-chordal mixed hypergraphs, Discrete Math. 202 (1999) 239-248.
36. A. Zykov, Fundamentals of Graph Theory, DCS Associates, Moscow, Idaho, USA, 1990.