Weak Diameter and Cyclic Properties in Oriented Graphs
Daniel Brito, Oscar Ramón Ordaz, Marı́a Teresa Varela · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2011
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a strong oriented graph are joining by a path of length at most a given $k$, or ensuring that they are contained in a common cycle.