3-Regular Colored Graphs and Classification of Surfaces

Article Type

Research Article

Publication Title

Discrete and Computational Geometry

Abstract

Motivated by the theory of crystallizations, we consider an equivalence relation on the class of 3-regular colored graphs and prove that up to this equivalence (a) there exists a unique contracted 3-regular colored graph if the number of vertices is 4m and (b) there are exactly two such graphs if the number of vertices is 4 m+ 2 for each m≥ 1. Using this, we present a simple proof of the classification of closed surfaces.

First Page

345

Last Page

354

DOI

10.1007/s00454-017-9861-3

Publication Date

9-1-2017

Comments

Open Access, Green

This document is currently not available here.

Share

COinS