
doi: 10.1007/bf02207695
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.
embedding, triangular mesh, triangular graph, edge contraction, planar graph, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs, Planar graphs; geometric and topological aspects of graph theory
embedding, triangular mesh, triangular graph, edge contraction, planar graph, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
