Abstract
We show 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.
Citation
Jin-ichi ITOH. Costin VÎLCU. "Every graph is a cut locus." J. Math. Soc. Japan 67 (3) 1227 - 1238, July, 2015. https://doi.org/10.2969/jmsj/06731227
Information
