TY - JOUR
T1 - Diagonal Flips in Hamiltonian Triangulations on the Sphere
AU - Mori, Ryuichi
AU - Nakamoto, Atsuhiro
AU - Ota, Katsuhiro
PY - 2003/11/10
Y1 - 2003/11/10
N2 - In this paper, we shall prove that any two Hamiltonian triangulations on the sphere with n ≥ 5 vertices can be transformed into each other by at most 4n - 20 diagonal flips, preserving the existence of Hamilton cycles. Moreover, using this result, we shall prove that at most 6n - 30 diagonal flips are needed for any two triangulations on the sphere with n vertices to transform into each other.
AB - In this paper, we shall prove that any two Hamiltonian triangulations on the sphere with n ≥ 5 vertices can be transformed into each other by at most 4n - 20 diagonal flips, preserving the existence of Hamilton cycles. Moreover, using this result, we shall prove that at most 6n - 30 diagonal flips are needed for any two triangulations on the sphere with n vertices to transform into each other.
UR - http://www.scopus.com/inward/record.url?scp=0242360740&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0242360740&partnerID=8YFLogxK
U2 - 10.1007/s00373-002-0508-6
DO - 10.1007/s00373-002-0508-6
M3 - Article
AN - SCOPUS:0242360740
SN - 0911-0119
VL - 19
SP - 413
EP - 418
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
IS - 3
ER -