Abstract
In this paper we prove that a finite triangulation of a connected closed surface is completely determined by its intersection matrix. The intersection matrix of a finite triangulation, K, is defined as \( M_K = (\dim (s_i \cap s_j ))_{0 \leqslant i,0 \leqslant j}^{n - 1} \), where K 2 = {s 0,… s n−1 } is a labelling of the triangles of K.
Research supported by PAPIIT-México IN112511 y CONACyT 166951.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
R. Blind and P. Mani-Levitska, Puzzles andpolytope isomorphisms, Aequationes Mathematicae 34 (1987), n. 3–4, 287–297.
G. Kalai, A simple way to tell a simple polytope from its graph, Journal of combinatorial theory, Series A. 49 (1988), n. 2, 381–383.
B. Grünbaum, “Convex Polytopes” Springer, 1967.
B. Mohar and A. Vodopivec On Polyhedral Embeddings of Cubic Graphs, Comb. Probab. Comput. 15 (2006), n. 6, 877–893.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Arocha, J., Bracho, J., García-Colín, N., Hubard, I. (2013). A characterization of triangulations of closed surfaces. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_36
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_36
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)