Skip to main content
Log in

The chromatic index of simple hypergraphs

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. 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)

  2. deBruijn, N.G., Erdös, P.: A combinational problem. Indagations Math.8, 461–467 (1946)

    Google Scholar 

  3. Colbourn, J., Colbourn, M.: The chromatic index of cyclic Steiner 2-design. Int. J. Math. and Math. Sci.5, 823–825 (1982)

    Google Scholar 

  4. Deza, M.: Une propriété extrémale des plans projectives finis dans une classe de codes équidistants. Discrete Math.6, 343–352 (1973)

    Google Scholar 

  5. 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

    Google Scholar 

  6. Hindman, N.: On a conjecture of Erdös, Faber, and Lovász aboutn-colorings. Canad. J. Math.33, 563–570 (1981)

    Google Scholar 

  7. Seymour, P.: Packing nearly disjoint sets. Combinatorica2, 91–97 (1982)

    Google Scholar 

  8. Vizing, V.G.: On an estimate of the chromatic class of ap-graph (in Russian). Diskret. Analiz3, 25–30 (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788081

Keywords

Navigation