Simpler proof of a realizability theorem on Delaunay triangulations
β Scribed by Kokichi Sugihara
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 293 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t
In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John
## Abstract We give a proof of GΓΆdel's first incompleteness theorem based on Berry's paradox, and from it we also derive the second incompleteness theorem modelβtheoretically. Mathematics Subject Classification: 03F30.