Directed and antidirected Hamiltonian cycles and paths in bipartite graphs
Directed graphs and matrix equations
Directed hypergraphs: a tool for researching digraphs and hypergraphs
In this paper we introduce the concept of directed hypergraph. It is a generalisation of the concept of digraph and is closely related with hypergraphs. The basic idea is to take a hypergraph, partition its edges non-trivially (when possible), and give a total order to such partitions. The elements of these partitions are called levels. In order to preserve the structure of the underlying hypergraph, we ask that only vertices which belong to exactly the same edges may be in the same level...
Directed subgraph complexes.
Disjonctions dans les ordonnancements
Distances between directed graphs
Dominating sets of random 2-in 2-out directed graphs.
Doubly Primitive Vertex Stabilisers in Graphs.