✦ LIBER ✦

Finite Subsets of the Plane are 18-Reconstructible

✍ Scribed by Pebody, L.; Radcliffe, A. J.; Scott, A. D.

Book ID: 118198876
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 207 KB
Volume: 16
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480101391648

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite affine planes of rank three are t

Finite affine planes of rank three are translation planes

✍ Robert A. Liebler 📂 Article 📅 1970 🏛 Springer-Verlag 🌐 French ⚖ 296 KB

The centroidal branches of a separable g

The centroidal branches of a separable graph are edge reconstructible

✍ Robert Molina 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 660 KB

If T is a tree, then the weight of a vertex v in T is the number of vertices in a largest component of T -v. The centroid of a tree is the set of vertices of minimum weight. We show that if G is a separable graph then there is a unique block or cutvertex that contains the centroids of all spanning t

Finite Laguerre planes of order 8 are ov

Finite Laguerre planes of order 8 are ovoidal

✍ Günter F. Steinke 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The Sets that are Scissor Congruent to a

The Sets that are Scissor Congruent to an Unbounded Convex Subset of the Plane

✍ Sydell Perlmutter Gold 📂 Article 📅 1976 🏛 American Mathematical Society 🌐 English ⚖ 507 KB

On Extreme Convex Subsets of the Plane

✍ G. Mielczarek 📂 Article 📅 1998 🏛 Akadmiai Kiad 🌐 English ⚖ 657 KB

Simply Connected Compact Subsets of the

Simply Connected Compact Subsets of the Plane

✍ T.I. Ramsamujh 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB