par Joret, Gwenaël 
;Wood, David
Référence Journal of combinatorial theory. Series B, 100, page (446-455)
Publication Publié, 2010
;Wood, David Référence Journal of combinatorial theory. Series B, 100, page (446-455)
Publication Publié, 2010
Article révisé par les pairs
| Résumé : | A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus g>1 has at most 13g-4 vertices. The best previous bound was 171g-72. © 2010 David Wood. |
