Irreducible triangulations are small

Authors:
Gwenaël Joret;David R. Wood
Affiliations:
Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium;Department of Mathematics and Statistics, The University of Melbourne, Melbourne, Australia
Venue:
Journal of Combinatorial Theory Series B
Year:
2010

Citing 13
Cited 1

An additivity theorem for the genus of a graph

Journal of Combinatorial Theory Series B
Generating locally cyclic triangulations of surfaces

Journal of Combinatorial Theory Series B
Note on irreducible triangulations of surfaces

Journal of Graph Theory
Irreducible triangulations of the Klein bottle

Journal of Combinatorial Theory Series B
Structural characterization of projective flexibility

Discrete Mathematics
Constructing the graphs that triangulate both the torus and the klein bottle

Journal of Combinatorial Theory Series B
Diagonal flips in outer-Klein-bottle triangulations

Discrete Mathematics
Generating triangulations on closed surfaces with minimum degree at least 4

Discrete Mathematics - Algebraic and topological methods in graph theory
Hierarchy of surface models and irreducible triangulations

Computational Geometry: Theory and Applications
Note: Note on the irreducible triangulations of the Klein bottle

Journal of Combinatorial Theory Series B
How to Exhibit Toroidal Maps in Space

Discrete & Computational Geometry
Geometric Realization of a Triangulation on the Projective Plane with One Face Removed

Discrete & Computational Geometry
N-flips in even triangulations on surfaces

Journal of Combinatorial Theory Series B

On the maximum number of cliques in a graph embedded in a surface

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.