✦ LIBER ✦

Generating the triangulations of the projective plane

✍ Scribed by David Barnette

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 392 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90041-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating even triangulations of the pr

Generating even triangulations of the projective plane

✍ Yusuke Suzuki; Takahiro Watanabe 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of __even‐splittings__ and __attaching octahedra__, both of which were first given by Batagelj 2

Generating the 4-connected and strongly

Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane

✍ D.W. Barnette 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 978 KB

The triangulations of the torus can be generated from a set of 21 minimal triangulations by vertex splitting. We show that if we never create a 3-valent vertex when we split them we generate the 4-connected triangulations. In addition if we never create two adjacent 4-valent vertexes then we gener

Coloring the projective plane

✍ Joel Spencer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 835 KB

It is shown that the points of a projective plane may be two-&ore discrepancy at most Knf, K an absolute constant. A variant of the p hat evee line has method is used. Connections to the Komlos Conjecture are discussed.

Minimal embeddings in the projective pla

Minimal embeddings in the projective plane

✍ Randby, Scott P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper

Planar graphs on the projective plane

✍ Bojan Mohar; Neil Robertson; Richard P. Vitray 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 958 KB

Wv paths in the projective plane

✍ D.W Barnette 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 327 KB

If a graph G is embedded in a manifold then a path in G is said to be a W~ path if and only if it never returns to a face of the graph once it leaves it. We prove that between each two vertices of a cell complex in the projective plane there is a W~ path.