2011/03/16 by Itoh, Jin-ichi, Vîlcu, Costin
#05C10 #53C22 #Differential Geometry (math.DG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1103.3136
We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface S. Here, criteria for the orientability of S are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles.