A Bound on the Strong Chromatic Index of a Graph

Journal of Combinatorial Theory. Series B

Volumn 69, Issue 2, 1997, Pages 103-109

  Molloy, Michael ^a   Reed, Bruce ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000564619     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1997.1724     Document Type: Article

References (11)

1. Alon N., Spencer J. The Probabilistic Method. 1992;Wiley, New York.
2. Andersen L. The strong chromatic index of a cubic graph is at most 10. Discrete Math. 108:1992;231-252.
3. 2. Discrete Math. 81:1990;129-135.
4. Erdos P., Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and Finite Sets. Colloq. Math. Soc. Janos Bolyai. Vol. 11:1975;North-Holland, Amsterdam.
5. Faudree R. J., Gyárfás A., Schelp R. H., Tuza Z. Induced matchings in bipartite graphs. Discrete Math. 78:1989;83-87.
6. Faudree R. J., Gyárfás A., Schelp R. H., Tuza Z. The strong chromatic index of graphs. Ars Combin. B. 29:1990;205-211.
7. Horák P. The strong chromatic index of graphs with maximum degree four. Bodendiek R. Contemporary Methods in Graph Theory. 1990;B. I. Wissenschaftsverlag.
8. Horák P., Qing H., Trotter W. T. Induced matchings in cubic graphs. J. Graph Theory. 17:1993;151-160.
9. Jensen T., Toft B. Graph Colouring Problems. 1995;Wiley, New York.
10. J. Spencer, 1995, Probabilistic methods in combinatorics, Proceedings of the International Congress of Mathematicians, Zürich, 1994, Birkhäuser, Berlin.
11. Talagrand M. Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81:1995;73-205.