Every graph is a cut locus
  We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior. 
Jin-ichi Itoh and Costin V\^ilcu
math.DG