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