𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A Simpler Proof of the Excluded Minor Th
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 223 KB

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

A short proof of a theorem on Hamiltonia
✍ Ainouche, A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

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

A Note on Boolos' Proof of the Incomplet
✍ Makoto Kikuchi πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 1 views

## 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.