Contents

-

On Oriented Graphs with Certain Extension Properties

Abstract

Let Γ be an oriented graph. We denote the in-neighborhood and out-neighborhood of a vertex v in Γ by Γ(v) and Γ+(v), respectively. We say Γ has Property A if, for each arc (u,v) in Γ, each of the graphs induced by Γ+(u)Γ+(v), Γ(u)Γ(v), Γ(u)Γ+(v), and Γ+(u)Γ(v) contains a directed cycle. Moreover, Γ has Property B if each arc (u,v) in Γ extends to a 3-path (x,u),(u,v),(v,w), such that |Γ+(x)Γ+(u)|5 and |Γ(v)Γ(w)|5. We show that the only oriented graphs of order at most 17, which have both properties A and B, are the Tromp graph T16 and the graph T16+, obtained by duplicating a vertex of T16. We apply this result to prove the existence of an oriented planar graph with oriented chromatic number at least 18.