arXiv Analytics

Sign in

arXiv:1103.5364 [math.CO]AbstractReferencesReviewsResources

Irreducible triangulations of surfaces with boundary

Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto

Published 2011-03-28, updated 2013-11-04Version 2

A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g>=0 with b>=0 boundaries is O(g+b). So far, the result was known only for surfaces without boundary (b=0). While our technique yields a worse constant in the O(.) notation, the present proof is elementary, and simpler than the previous ones in the case of surfaces without boundary.

Journal: Graphs and Combinatorics 29(6):1675-1688, 2013
Categories: math.CO, cs.DM
Subjects: 05C10, 57M15, 57N05
Related articles: Most relevant | Search more
arXiv:0907.1421 [math.CO] (Published 2009-07-09, updated 2010-02-19)
Irreducible Triangulations are Small
arXiv:1208.0744 [math.CO] (Published 2012-08-03)
Drawing outerplanar graphs
arXiv:math/0602163 [math.CO] (Published 2006-02-08, updated 2008-02-07)
Transversal structures on triangulations: a combinatorial study and straight-line drawings