References
Berge, C.: On the chromatic index of a linear hypergraph and the Chvátal conjecture. Annals of the New York Academy of Sciences, the proc. of 1985 meeting. (to appear)
deBruijn, N.G., Erdös, P.: A combinational problem. Indagations Math.8, 461–467 (1946)
Colbourn, J., Colbourn, M.: The chromatic index of cyclic Steiner 2-design. Int. J. Math. and Math. Sci.5, 823–825 (1982)
Deza, M.: Une propriété extrémale des plans projectives finis dans une classe de codes équidistants. Discrete Math.6, 343–352 (1973)
Erdös, P.: Problems and results in graph theory and combinational analysis. In: Proc. Fifth British Comb. Conf., pp 169–192. Congr. Numerantium 15. Winnipeg: Utilitas Mathematica 1976
Hindman, N.: On a conjecture of Erdös, Faber, and Lovász aboutn-colorings. Canad. J. Math.33, 563–570 (1981)
Seymour, P.: Packing nearly disjoint sets. Combinatorica2, 91–97 (1982)
Vizing, V.G.: On an estimate of the chromatic class of ap-graph (in Russian). Diskret. Analiz3, 25–30 (1964)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Füredi, Z. The chromatic index of simple hypergraphs. Graphs and Combinatorics 2, 89–92 (1986). https://doi.org/10.1007/BF01788081
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01788081