Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135364/1/jlms0087.pd
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractWe characterise the directed graphs such that, for every induced subgraph, one can define (d...
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subd...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractA digraph without any cycle of length two is called an oriented graph. The local-edge-connec...
AbstractWe characterise the directed graphs such that, for every induced subgraph, one can define (d...
AbstractWe survey results and possible results of the following type: given positive integers n,k,d,...
Given a directed graph, a natural topology is defined and relationships between standard topological...
AbstractWe generalize the class of split graphs to the directed case and show that these split digra...
Abstract. Given a (multi)digraph H, a digraph D is H-linked if every injective function ι: V (H) → V...
We generalize the class of split graphs to the directed case and show that these split digraphs can ...
AbstractWe generalize the class of split graphs to the directed case and show that these split digra...
We generalize the class of split graphs to the directed case and show that these split digraphs can ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractWe characterise the directed graphs such that, for every induced subgraph, one can define (d...
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subd...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractA digraph without any cycle of length two is called an oriented graph. The local-edge-connec...
AbstractWe characterise the directed graphs such that, for every induced subgraph, one can define (d...
AbstractWe survey results and possible results of the following type: given positive integers n,k,d,...
Given a directed graph, a natural topology is defined and relationships between standard topological...
AbstractWe generalize the class of split graphs to the directed case and show that these split digra...
Abstract. Given a (multi)digraph H, a digraph D is H-linked if every injective function ι: V (H) → V...
We generalize the class of split graphs to the directed case and show that these split digraphs can ...
AbstractWe generalize the class of split graphs to the directed case and show that these split digra...
We generalize the class of split graphs to the directed case and show that these split digraphs can ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractWe characterise the directed graphs such that, for every induced subgraph, one can define (d...
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subd...
DOI
Add to ORKG