A Note on Short Paths in Oriented Graphs
Samvel Kh. Darbinyan, Iskandar A. Karapetyan · Mathematical Problems of Computer Science · 2010
Let G be an oriented graph of order p ¸ 3 and minimum semi-degrees at least [p=2]-k for a positive integer k. For a subset C of vertices G, we obtain sufficient conditions implying that for any pair of distinct vertices x; y 2 V (G)-C there is a path from x to y of length less than a given integer which does not contain the vertices of C.