In this paper, we prove that any two triangulations of a given polygon may be transformed into one another by a signable sequence of flips if and only if every planar graph is 4-colorable. This result prove a conjecture due to Eliahou. Dans ce papier, on montre que l'on peut passer de toute triangu
Acute Triangulations of Polygons
β Scribed by H. Maehara
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 122 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove that every n-gon can be triangulated into O(n) acute triangles. We also present a short proof of the result that every polygon can be triangulated into right triangles.
π SIMILAR VOLUMES
We examine the relationship between collineations of generalized polygons and certain 'symmetries' of their coordinating structures.
In this paper we prove the following: Over each algebraically closed field K of Ε½ . characteristic 0 there exist precisely three algebraic polygons up to duality , namely the projective plane, the symplectic quadrangle, and the split Cayley Ε½ . hexagon over K Theorem 3.3 . As a corollary we prove th
## Abstract The __prism__ over a graph __G__ is the Cartesian product __G__ββ‘β__K__~2~ of __G__ with the complete graph __K__~2~. If the prism over __G__ is hamiltonian, we say that __G__ is __prismβhamiltonian__. We prove that triangulations of the plane, projective plane, torus, and Klein bottle
We use a construction of A. Bouchet for covering triangulations by means of nowhere-zero dual flows, but slightly modified, to prove that whenever \(G\) is a simple graph, which is not a star, two-cell embedded in a surface \(S\), and \(m\) is a nonnegative integer not divisible by 2,3 , or 5 , ther
In this note we show that, for any surface 7 and any k, there are at most finitely many triangulations of 7 such that each edge is in a noncontractible cycle of length k and is in no shorter noncontractible cycle. Such a triangulation is k-irreducible. This is equivalent to the statement that for an