  A graph $G$ is primarily orientable if it is possible to orient its edges in
such a way that the resulting oriented graph is prime, i.e., indecomposable
under modular decomposition. We characterize primarily orientable graphs.
