AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d=3, their general bounds reduce to 8⩽f(3)⩽24. We improve these bounds to 9⩽f(3)⩽11
AbstractThe average distance of a graph (strong digraph) G, denoted by μ(G) is the average, among th...
This is the post-print version of the Article. The official published version can be accessed from t...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is st...
In this dissertation, I will discuss two results on the oriented diameter of graphs with certain pro...
In this dissertation, I will discuss two results on the oriented diameter of graphs with certain pro...
We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of ...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractAn orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exac...
AbstractWe prove that a graph with maximum degree 3 and diameter d≥4 cannot have exactly two vertice...
AbstractThe average distance of a graph (strong digraph) G, denoted by μ(G) is the average, among th...
This is the post-print version of the Article. The official published version can be accessed from t...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is st...
In this dissertation, I will discuss two results on the oriented diameter of graphs with certain pro...
In this dissertation, I will discuss two results on the oriented diameter of graphs with certain pro...
We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of ...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractAn orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exac...
AbstractWe prove that a graph with maximum degree 3 and diameter d≥4 cannot have exactly two vertice...
AbstractThe average distance of a graph (strong digraph) G, denoted by μ(G) is the average, among th...
This is the post-print version of the Article. The official published version can be accessed from t...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
DOI
Add to ORKG