Cut locus structures on graphs

DOI10.1016/j.disc.2011.03.021zbMath1233.05166OpenAlexW2068891778MaRDI QIDQ658087

Jin-ichi Itoh, Costin Vîlcu

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.021

zbMATH Keywords

cut locuscombinatorial structure of graphs

Mathematics Subject Classification ID

Global Riemannian geometry, including pinching (53C20) Structural characterization of families of graphs (05C75) Enumerative combinatorics (05A99)

Related Items (2)

Every graph is a cut locus ⋮ A cut locus for finite graphs and the farthest point mapping

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The length of a cut locus on a surface and Ambrose's problem
• Many endpoints and few interior points of geodesics
• Stability of the cut locus in dimensions less than or equal to 6
• Scattering of geodesic fields, I
• Train-tracks for surface homeomorphisms
• Metric structure of cut loci in surfaces and Ambrose's problem
• On the cut locus in Alexandrov spaces and applications to convex surfaces
• Cut loci of submanifolds in space forms and in the geometries of Möbius and Lie
• The cut locus and conjugate locus of a riemannian manifold
• Connections between differential geometry and topology. I. Simply connected surfaces
• Simplicial Structure of the Real Analytic Cut Locus

This page was built for publication: Cut locus structures on graphs