Alon, N., Krivelevich, M. and Sudakov, B. (1999) Coloring graphs with sparse neighborhoods.
J. Combin. Theory Ser. B
Andersen, L. D. (1992) The strong chromatic index of a cubic graph is at most 10. Discrete Math.
Azuma, K. (1967) Weighted sums of certain dependent random variables. Tôhoku Math. J.
Bonamy, M., Perrett, T. and Postle, L. (2016) Reed's conjecture and strong edge coloring. Paper given at Scottish Combinatorics Meeting, Glasgow.
Chung, F. R. K., Gyárfás, A., Tuza, Z. and Trotter, W. T. (1990) The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Math.
Cranston, D. W. (2006) Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Math.
Diestel, R. (2010) Graph Theory, fourth edition, Springer.
Faudree, R. J., Schelp, R. H., Gyárfás, A. and Tuza, Z. (1989) Induced matchings in bipartite graphs. Discrete Math.
Faudree, R. J., Schelp, R. H., Gyárfás, A. and Tuza, Z. (1990) The strong chromatic index of graphs. Ars Combin.
Grable, D. A. (1998) A large deviation inequality for functions of independent, multi-way choices. Combin. Probab. Comput.
Horák, P., Qing, H. and Trotter, W. T. (1993) Induced matchings in cubic graphs. J. Graph Theory
Joos, F. (2016) Induced matchings in graphs of bounded maximum degree. SIAM J. Discrete Math.
Joos, F. and Nguyen, V. H. (2016) Induced matchings in graphs of degree at most 4. SIAM J. Discrete Math.
Joos, F., Rautenbach, D. and Sasse, T. (2014) Induced matchings in subcubic graphs. SIAM J. Discrete Math.
Kaiser, T. and Kang, R. (2014) The distance-t chromatic index of graphs. Combin. Probab. Comput.
Kim, J. H. (1995) On Brooks' theorem for sparse graphs. Combin. Probab. Comput.
Kim, J. H. and Vu, V. H. (2000) Concentration of multivariate polynomials and its applications. Combinatorica
Kutin, S. (2002) Extensions to McDiarmid's inequality when differences are bounded with high probability. Technical Report TR-2002-04, University of Chicago.
Mahdian, M. (2000) The strong chromatic index of C
4-free graphs. Random Struct. Alg.
McDiarmid, C. (1989) On the method of bounded differences. In Surveys in Combinatorics, Vol. 141 of London Mathematical Society Lecture Note series, Cambridge University Press, pp. 148–188.
McDiarmid, C. (2002) Concentration for independent permutations. Combin. Probab. Comput.
Molloy, M. and Reed, B. (1997) A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B
Molloy, M. and Reed, B. (1998) A bound on the total chromatic number. Combinatorica
Molloy, M. and Reed, B. (2002) Graph Coloring and the Probabilistic Method, Springer.
Rivin, I. (2002) Counting cycles and finite dimensional L
norms. Adv. Appl. Math.
Śleszyńska-Nowak, M. (2016) Clique number of the square of a line graph. Discrete Math.
Talagrand, M. (1995) Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math.
van Lint, J. H. (1999) Introduction to Coding Theory, Graduate Texts in Mathematics, New York University Press.
Warnke, L. (2016) On the method of typical bounded differences. Combin. Probab. Comput.