Every graph is a cut locus

From MaRDI portal




Abstract: 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.



Cites work







This page was built for publication: Every graph is a cut locus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500097)