L. Barrì-ere, C. Huemer, D. Mitsche, and D. Orden, On the Fiedler value of large planar graphs (Extended abstract), The Sixth European Conference on Combinatorics, Graph Theory and Applications, pp.111-116, 2011.
DOI : 10.1016/j.endm.2011.09.019

M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, vol.23, issue.2, pp.298-305, 1973.

J. Ne?et?il, P. Ossona, and . Mendez, From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits, European Congress of Mathematics, pp.135-165, 2010.
DOI : 10.4171/077-1/7

J. Ne?et?il, P. Ossona, and . Mendez, Sparsity (Graphs, Structures, and Algorithms), volume 28 of Algorithms and Combinatorics, 2012.

D. A. Spielman and S. Teng, Spectral partitioning works: Planar graphs and finite element meshes, 37th Annual Symposium on Foundations of Computer Science (FOCS '96), pp.96-106, 1996.
DOI : 10.1016/j.laa.2006.07.020

URL : http://doi.org/10.1016/j.laa.2006.07.020

D. A. Spielman and S. Teng, Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra and its Applications, vol.421, issue.2-3, pp.284-305, 2007.
DOI : 10.1016/j.laa.2006.07.020

URL : http://doi.org/10.1016/j.laa.2006.07.020