Weak diameter and cyclic properties in oriented graphs

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.

Autores:: Brito, Daniel
Ordaz, Oscar
Varela, María Teresa

Tipo de recurso:: Article of journal

Fecha de publicación:: 2011

Institución:: Universidad Nacional de Colombia

Repositorio:: Universidad Nacional de Colombia

Idioma:: spa

Cannot write session to /tmp/vufind_sessions/sess_2s3ke74iaqvpkmq8g8n608r2to