L'affectation exponentielle et le problème du plus court chemin dans un graphe
Large bounded degree trees in expanding graphs.
Large holes in quasi-random graphs.
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences.
Largest minimal percolating sets in hypercubes under 2-bootstrap percolation.
Le problème de collecte des ordures urbaines
Le problème du voyageur de commerce dans un produit cartésien de deux graphes
Line minimal Boolean forests
Linear forests and ordered cycles
A collection (1 ≤ t ≤ k) of t disjoint paths, s of them being singletons with |V(L)| = k is called a (k,t,s)-linear forest. A graph G is (k,t,s)-ordered if for every (k,t,s)-linear forest L in G there exists a cycle C in G that contains the paths of L in the designated order as subpaths. If the cycle is also a hamiltonian cycle, then G is said to be (k,t,s)-ordered hamiltonian. We give sharp sum of degree conditions for nonadjacent vertices that imply a graph is (k,t,s)-ordered hamiltonian.
Locally connected graphs
Locally disconnected graphs with large numbers of edges
Locally path-like graphs
Locally snake-like graphs
Locally-cyclic graphs covering complete tripartite graphs
Location-domatic number of a graph
A subset of the vertex set of a graph is called locating-dominating, if for each there exists a vertex adjacent to and for any two distinct vertices , of the intersections of with the neighbourhoods of and are distinct. The maximum number of classes of a partition of whose classes are locating-dominating sets in is called the location-domatic number of Its basic properties are studied.
Long path lemma concerning connectivity and independence number.
Lower bound for the size of maximal nontraceable graphs.
Lower bounds for integral functionals generated by bipartite graphs
We study lower estimates for integral fuctionals for which the structure of the integrand is defined by a graph, in particular, by a bipartite graph. Functionals of such kind appear in statistical mechanics and quantum chemistry in the context of Mayer's transformation and Mayer's cluster integrals. Integral functionals generated by graphs play an important role in the theory of graph limits. Specific kind of functionals generated by bipartite graphs are at the center of the famous and much studied...
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Lower bounds for the size of random maximal -free graphs.