The strong chromatic index of C4-free graphs

Random Structures and Algorithms

Volumn 17, Issue 3-4, 2000, Pages 357-375

  Mahdian, Mohammad ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034359367     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200010/12)17:3/4<357::AID-RSA9>3.0.CO;2-Y     Document Type: Article

References (12)

1. N. Alon, M. Krivelevich, and B. Sudakov, Coloring graphs with sparse neighborhoods, J Combin Theory Ser B 77 (1999), 73-82.
2. N. Alon and J. Spencer, The Probabilistic Method, John Wiley & Sons, Inc., New York, 1992.
3. P. Erdo″s and J. Nešetřil, "Problems," in Irregularities of Partitions, G. Halász and VT. Sós (Eds.) Algorithms and Combinatorics: Study and Research Texts 8, Springer-Verlag, Berlin-New York 1989, pp. 162-163.
4. R.J. Faudree, A. Gyárfas, R.H. Schelp, and Zs. TUZA, Induced matchings in bipartite graphs, Discrete Math 78 (1989), 83-87.
5. R.J. Faudree, A. Gyárfas, R.H. Schelp, and Zs. TUZA, The strong chromatic index of graphs, Ars Combin 29B (1990), 205-211.
6. J.H. Kim, On Brook's Theorem for sparse graphs, Combin Probab Comput 4 (1995), 97-132.
7. M. Molloy, and B. Reed, Graph Coloring and the Probabilistic Method, a book in preparation.
8. M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, J. Combin Theory Ser. B 69 (1997), 103-109.
9. B. Reed, The list coloring constants, J Graph Theory 31 (1999), 149-153.
10. J. Spencer, Applications of Talagrand's inequality, manuscript.
11. M. Talagrand, A new isoperimetric inequality for product measure and the tails of sums of independent random variables, Geom Func Anal 1 (1991), 211-223.
12. Van H. Vu, On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs, J. Graph Theory 31 (1999), 201-226.