On Frank's conjecture on k-connected orientations
  We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete. 
Olivier Durand de Gevigney
math.CO cs.DM