✦ LIBER ✦

Connectivity of plane triangulations

✍ Scribed by Jean-Paul Laumond

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 869 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90142-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On connectivity of triangulations of man

On connectivity of triangulations of manifolds

✍ P.M. Winkler 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 165 KB

An edge of a k-graph is "separating" if there is ir k-coloring of the vertices assigning all colors to that edge only. We prove that no edge of any triangulation of any manifold of any dimension is separating.

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

Nonhamiltonian Triangulations with Large

Nonhamiltonian Triangulations with Large Connectivity and Representativity

✍ Dan Archdeacon; Nora Hartsfield; C.H.C. Little 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Diagonal 11-coloring of plane triangulat

Diagonal 11-coloring of plane triangulations

✍ Oleg V. Borodin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract The vertices of each plane triangulation without loops and multiple edges may be colored with 11 colors so that for every two adjacent triangles [__xyz__] and [__wxy__], the vertices __x__,__y__,__w__,__z__ are colored pairwise differently.

Hamilton cycles in plane triangulations

✍ Bill Jackson; Xingxing Yu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract We extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation __G__ into 4‐connected ‘pieces,’ and show that if each piece shares a triangle

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