Does contraction preserve triangular meshes? (Q676930)
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: Does contraction preserve triangular meshes? |
scientific article; zbMATH DE number 993905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Does contraction preserve triangular meshes? |
scientific article; zbMATH DE number 993905 |
Statements
Does contraction preserve triangular meshes? (English)
0 references
24 September 1997
0 references
A triangular graph is a planar graph in which each face is a triangle, except possibly for the exterior face, and without articulation nodes. The embedding of a triangular graph in the plane is called a triangular mesh. The paper gives a necessary and sufficient condition saying for which graphs triangularity is preserved after some edge contraction.
0 references
triangular graph
0 references
planar graph
0 references
embedding
0 references
triangular mesh
0 references
edge contraction
0 references
0.7508103251457214
0 references
0.7288020253181458
0 references
