Abstract
A quadrangulation is a spherical map of a simple graph such that each face is bounded by a cycle of length four. Since every quadrangulation G is bipartite, G has a unique bipartition V(G) = B ∪ W, where we call (|B|,|W|) the bipartition size of G. In this article, we shall prove that any two quadrangulations G and G′ with the same bipartition size can be transformed into each other by at most 10|B| + 16|W| − 64 diagonal slides.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Komuro, H.: The diagonal flips of triangulations on the sphere. Yokohama Math. J. 44, 115–122 (1997)
Mori, R., Nakamoto, A., Ota, K.: Diagonal flips in Hamiltonian triangulations on the sphere. Graphs Combin. 19, 413–418 (2003)
Nakamoto, A.: Diagonal transformations and cycle parities of quadrangulations on surfaces. J. Combin. Theory Ser. B 67, 202–211 (1996)
Nakamoto, A.: Diagonal transformations in quadrangulations on surfaces. J. Graph Theory 21, 289–299 (1996)
Nakamoto, A.: Quadrangulations on closed surfaces. Interdiscip. Inform. Sci. 7, 77–98 (2001)
Nakamoto, A., Suzuki, Y.: Diagonal slides and rotations in quadrangulations on the sphere. Yokohama Math. J. 55, 105–112 (2010)
Negami, S.: Diagonal flips in triangulations on surfaces. Discrete Math. 135, 225–232 (1994)
Negami, S.: Diagonal flips of triangulations on surfaces, a survey. Yokohama Math. J. 47, 1–40 (1999)
Wagner, K.: Bemekungen zum Vierfarbenproblem. J. der Deut. Math. 46, Abt. 1, 26–32 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsumoto, N., Nakamoto, A. (2013). The Number of Diagonal Transformations in Quadrangulations on the Sphere. In: Akiyama, J., Kano, M., Sakai, T. (eds) Computational Geometry and Graphs. TJJCCGG 2012. Lecture Notes in Computer Science, vol 8296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45281-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-45281-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45280-2
Online ISBN: 978-3-642-45281-9
eBook Packages: Computer ScienceComputer Science (R0)