Weak diameter and cyclic properties in oriented graphs
Tipo de contenido
Artículo de revista
Idioma del documento
EspañolFecha de publicación
2011Resumen
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.Palabras clave
Colecciones
![Atribución-NoComercial 4.0 Internacional](/themes/Mirage2//images/creativecommons/cc-generic.png)