Locally k-degenerate graphs: a definition and two conjectures.
Locally linear graphs
Locally one-to-one mappings on graphs
Locally path-like graphs
Locally primitive normal Cayley graphs of metacyclic groups.
Locally regular graphs
A graph is called locally -regular if the neighbourhood of each vertex of induces a subgraph of which is regular of degree . We study graphs which are locally -regular and simultaneously regular of degree .
Locally snake-like graphs
Locally tree-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.
Logarithmic components of the vacant set for random walk on a discrete torus.
Logconcave random graphs.
Logics of bipartite graphs and complete multipartite graphs
Lokální vlastnosti grafů
Long cycles and neighborhood union in 1-tough graphs with large degree sums
Long cycles in certain graphs of large degree.
Long heterochromatic paths in edge-colored 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