Uncolorable mixed hypergraphs

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 209-227

  Tuza, Zsolt ^a   Voloshin, Vitaly ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012211030     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00134-1     Document Type: Article

References (20)

1. C. Berge, Hypergraphs - Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
2. Biró M., Hujter M., Tuza Zs. Precoloring extension, I. Interval graphs. Discrete Math. 100:1992;267-279.
3. de Brandes M., Rödl V. Steiner triple systems with small maximal independent sets. Ars Combin. 17:1984;15-19.
4. Bulgaru E., Voloshin V.I. Mixed interval hypergraphs. Discrete Appl. Math. 77(1):1997;24-41.
5. Erdos P., Hajnal A. On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hungar. 17:1966;61-99.
6. T. Gallai, On directed paths and circuits, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 115-118.
7. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, New York, 1995.
8. Kempe A.B. On the geographical problem of four colors. Amer. J. Math. 2:1879;193-200.
9. L. Lovász, Coverings and colorings of hypergraphs, in: Proceedings of the fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Math. Publ., Winnipeg, 1973, pp. 3-12.
10. Milazzo L., Tuza Zs. Upper chromatic number of Steiner triple and quadruple systems. Discrete Math. 174:1997;247-259.
11. Milazzo L., Tuza Zs. Strict colorings for classes of Steiner triple systems. Discrete Math. 182:1998;233-243.
12. A. Oboroc, HYCON - hypergraph drawing and converting system, M.Sc.Thesis, Moldova State University, 1997.
13. Roy B. Nombre chromatique et plus longs chemins d'un graphe. Rev. Française Automat. Informat. Recherche Operationelle Ser. Rouge. 1:1967;127-132.
14. Szekeres G., Wilf H.S. An inequality for the chromatic number of a graph. J. Combin. Theory. 4:1968;1-3.
15. Tuza Zs. Graph coloring in linear time. J. Combin. Theory Ser. B. 55:1992;236-243.
16. Tuza Zs. Graph colorings with local constraints - a survey. Discussiones Mathematicae Graph Theory. 17:1997;161-228.
17. Zs. Tuza, V. Voloshin, H. Zhou, Uniquely colorable mixed hypergraphs, submitted for publication.
18. Voloshin V. The mixed hypergraphs. Comp. Sci. J. Moldova. 1(1):1993;45-52.
19. Voloshin V. On the upper chromatic number of a hypergraph. Australas. J. of Combinat. 11:1995;25-45.
20. V. Voloshin, Hypergraph drawing and optimization system, Atti Academia Peloritana dei Pericolanti Classe I di Scienze Fis. Mat. e Nat. LXXIII (1995) 1-3.