On critically connected digraphs

A digraph is called critically connected if it is connected, but the deletion of any vertex destroys the connectivity. We prove that every critically connected finite digraph has at least two vertices of outdegree one. As an application, we show that for n ≧ 2, there is no n-connected, non-complete, finite digraph such that the deletion of any n vertices results in a disconnected digraph.