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
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Distances invariantes et L-cliques sur certains demi-groupes finis
Domatic number and linear arboricity of cacti
Domatic numbers of lattice graphs
Domatically cocritical graphs
Domatically critical graphs
Double covers and logics of graphs
Double covers and logics of graphs. II.
Dual approach to edge distance between graphs
Dualizing cubic graph theory
Důkaz Brouwerovy věty metodou teorie grafů
Edge Bases of Complete Uniform Hypergraphs
Edge neighborhoods in line graphs.
Edge neighbourhood graphs
Edge rotations and distance between graphs
Edge-domatic numbers of cacti
The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.