Decomposition of an infinite complete graph into complete bipartite subgraphs
Decomposition of complete bipartite graphs into factors with given radii
Decomposition of complete bipartite graphs into factors with given diameters
Decomposition of complete graphs into trees
Decompositions of complete -uniform hypergraphs into factors with given diameters
Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter
Definability in structures of finite valency
Degree sets for graphs
Degree sets for homogeneously traceable non-Hamiltonian graphs
Delaunay Graphs Are Almost as Good as Complete Graphs.
Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe
Dépliage d'un graphe pointé en un cactus
Description combinatoire des ultramétriques
Different types of products and subdirectly irreducible
Dimension of amalgamated graphs and trees
Dimension of the sum of several copies of a graph
Dimension of the sum of two copies of a graph
Direct product decompositions of digraphs
Directed pseudo-graphs and Lie algebras over finite fields
The main goal of this paper is to show an application of Graph Theory to classifying Lie algebras over finite fields. It is rooted in the representation of each Lie algebra by a certain pseudo-graph. As partial results, it is deduced that there exist, up to isomorphism, four, six, fourteen and thirty-four -, -, -, and -dimensional algebras of the studied family, respectively, over the field . Over , eight and twenty-two - and -dimensional Lie algebras, respectively, are also found. Finally,...
Disconnected neighbourhood graphs