La régularisation dans les problèmes combinatoires et son application au problème des tournées de livraison
La structure de certains problèmes d'affectation
Labyrinthologie mathématique (I)
Le graphe de «La nuit des rois»
Leaps: an approach to the block structure of a graph
To study the block structure of a connected graph G = (V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V. These algebraic structures are easily studied by considering their underlying graphs, which turn out to be block graphs. Conversely, we define the operation as well as the set of leaps of the connected graph G. The underlying graph of , as well...
Leaves, excesses and neighborhoods
Les arbres et les indices de centralité et de compacité de P. Parlebas
Les graphes de transfert et la notion de graphe inverse
Local-global convergence, an analytic and structural approach
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global convergence to graphs with unbounded degrees. As an application, we extend previous results on continuous clustering of local convergent sequences and prove the existence of modeling quasi-limits for local-global convergent sequences of nowhere dense graphs.
Locally connected graphs
Locally homogeneous graphs with dense links at vertices
Locally k-degenerate graphs: a definition and two conjectures.
Locally linear graphs
Logics of bipartite graphs and complete multipartite graphs
Lokální vlastnosti grafů
Lower bound for the norm of a vertex-transitive graph.