Haslegrave, John (2023) Determining triangulations and quadrangulations by boundary distances. Journal of Combinatorial Theory, Series B, 163. pp. 233-255. ISSN 0095-8956
Text (triangulation-reconstruction-v2)
triangulation-reconstruction-v2.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (304kB)
triangulation-reconstruction-v2.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (304kB)
Abstract
We show that if all internal vertices of a disc triangulation have degree at least 6, then the full structure can be determined from the pairwise graph distances between boundary vertices. A similar result holds for disc quadrangulations with all internal vertices having degree at least 4. This confirms a conjecture of Itai Benjamini. Both degree bounds are best possible, and correspond to local non-positive curvature. However, we show that a natural conjecture for a “mixed” version of the two results is not true.
Item Type:
Journal Article
Journal or Publication Title:
Journal of Combinatorial Theory, Series B
Uncontrolled Keywords:
Research Output Funding/yes_externally_funded
Subjects:
?? planar graphtriangulationgraph distanceboundary rigiditygraph reconstructionyes - externally fundeddiscrete mathematics and combinatoricscomputational theory and mathematicstheoretical computer science ??
Departments:
ID Code:
208161
Deposited By:
Deposited On:
24 Oct 2023 12:50
Refereed?:
Yes
Published?:
Published
Last Modified:
28 Aug 2024 00:30