%0 Journal Article
%T Weak Diameter and Cyclic Properties in Oriented Graphs
%A BRITO
%A DANIEL
%A ORDAZ
%A OSCAR
%A VARELA
%A MAR¨ªA TERESA
%J Revista Colombiana de Matem¨¢ticas
%D 2011
%I Universidad Nacional de Colombia and Sociedad Colombiana de Matem¨¢ticas
%X 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.
%K weak diameter
%K 2-cyclic
%K oriented graph.
%U http://www.scielo.org.co/scielo.php?script=sci_abstract&pid=S0034-74262011000200002&lng=en&nrm=iso&tlng=en