3-regular colored graphs and classification of surfaces (Q2408210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 3-regular colored graphs and classification of surfaces |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-regular colored graphs and classification of surfaces |
scientific article |
Statements
3-regular colored graphs and classification of surfaces (English)
0 references
10 October 2017
0 references
In this paper, the author studies 3-regular colored graphs and define an equivalence relation on them. He proves that up to this defined relation, (a) there exists a unique contracted 3-regular colored graph if the number of the vertices is \(4m\) and (b) there are exactly two such graphs if the number of vertices is \(4m+2\) for each \(m>0\). By means of this, he gives a proof of the closed surfaces. The main method used in the proofs is a simple cut and glue operation. The paper is written in a nice way and may be useful in a large area.
0 references
regular graph
0 references
colored graph
0 references
crystallization
0 references
cell complex
0 references
closed surface
0 references
0.8701067566871643
0 references
0.8048144578933716
0 references
0.7950004935264587
0 references
