Laplacian of graphs and algebraic connectivity
Locally disconnected graphs with large numbers of edges
Locally tree-like graphs
Long induced paths in 3-connected planar graphs
It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.
Long path lemma concerning connectivity and independence number.
Longest circuits in triangular and quadrangular -polytopes with two types of edges