arXiv:1303.3674 [math.CO]AbstractReferencesReviewsResources
A characterization of triangulations of closed surfaces
Jorge Arocha, Javier Bracho, Natalia Garcia-Colin, Isabel Hubard
Published 2013-03-15Version 1
In this paper we prove that a finite triangulation of a connected closed surface is completely determined by its intersection matrix. The \emph{intersection matrix} of a finite triangulation, $K$, is defined as $M_{K}=(dim(s_{i}\cap s_{j}))_{0\leq i,0\leq j}^{n-1}$, where $K_{2}=\{s_{0}, \ldots s_{n-1}\}$ is a labelling of the triangles of $K$.
Comments: Submitted to EUROCOMB 2013
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1507.06800 [math.CO] (Published 2015-07-24)
The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs
arXiv:math/0212139 [math.CO] (Published 2002-12-10)
Characterization of SDP Designs That Yield Certain Spin Models
arXiv:1702.05873 [math.CO] (Published 2017-02-20)
Characterization of 1-Tough Graphs using Factors