C. Borgs, J. Chayes, L. Lovász, V.T. Sós and K.
Vesztergombi: Counting Graph Homomorphisms, in: Topics in
Discrete Mathematics, (ed. M. Klazar, J. Kratochvil, M. Loebl, J.
Matousek, R. Thomas, P. Valtr), Springer (2006), 315-371. pdf
L. Lovász: Discrete Analytic Functions: a
survey, in: Eigenvalues of Laplacians and other geometric
operators (ed. A. Grigor’yan, S.-T. Yau), International Press,
Surveys in Differential Geometry IX (2004), pdf
L. Lovász: Semidefinite programs and
combinatorial optimization, in: Recent Advances in Algorithms
and Combinatorics (ed. B.A. Reed, C.L. Linhares-Sales), CMS Books
Math./Ouvrages Math. SMC 11, Springer, New York (2003),
137-194.postscript
L. Lovász and K. Vesztergombi: Geometric
representations of graphs, in: Paul Erdős and his Mathematics,
(ed. G. Halász, L. Lovász, M. Simonovits, V.T.
Sós), Bolyai Soc. Math. Stud.
11, János Bolyai Math.
Soc., Budapest (2002), 471-498.
postscript
H. van der Holst, L. Lovász and A. Schrijver:
The Colin de Verdiére graph parameter, in: Graph Theory
and Combinatorial Biology (Balatonlelle, 1996), Bolyai Soc. Math.
Stud., 7, János Bolyai Math. Soc., Budapest, 1999, 29-85.
postscript
L. Lovász and P. Winkler: Mixing of random
walks and other diffusions on a graph, in: Surveys in
Combinatorics (ed. P. Rowlinson), London Math. Soc. Lecture Notes
Series 218, Cambridge Univ. Press (1995), 119-154. postscript
L. Lovász: Random Walks on Graphs: A Survey,
in: Combinatorics, Paul Erdős is Eighty, Vol. 2 (ed. D. Miklós,
V. T. Sós, T. Szőnyi), János Bolyai Mathematical Society, Budapest,
1996, 353-398. postscript
L. Lovász and P. Winkler: Mixing Times,
in: Microsurveys in Discrete Probability (ed. D. Aldous and J.
Propp), DIMACS Series in Discrete Math. and theor. Comp. Sci., AMS
1998, 85-133. postscript
L. Lovász: Communication Complexity: a Survey,
in: Paths, flows, and VLSI-Layout, (ed. B. Korte, L.
Lovász, H.J. Prömel, A. Schrijver), Springer (1990), 235-265.
pdf (long!)