✦ LIBER ✦

On a triangulation consistent with covering

✍ Scribed by A. M. Petrunin

Book ID: 105134655
Publisher: Springer US
Year: 1994
Tongue: English
Weight: 233 KB
Volume: 72
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01249524

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(m)-covering of a triangulation

✍ Dominique Benard; Andre Bouchet; Jean-Luc Fouquet 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Let G be a graph triangularly imbedded into a surface S, G0,,) is the graph constructed from G by replacing each vertex x by m vertices (x, 0), (x, 1) ..... (x, m-1) and joining two vertices (x, i) and (y, j) by an edge if and only if x and y are joined in G. The main result is that the construction

On covering bridged plane triangulations

On covering bridged plane triangulations with balls

✍ Victor Chepoi; Yann Vaxès 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract We show that every plane graph of diameter 2__r__ in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius __r__. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003

Constructions of covering triangulations

Constructions of covering triangulations with folds

✍ André Bouchet 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 704 KB

## Abstract Let __G__ be a graph with a known triangular embedding in a surface __S__, and consider __G__~(__m__)~, the composition of __G__ with an independant set of order __m.__ The purpose of this paper is to construct a triangular embedding of __G__~(__m__)~ into a surface magnified image by u

On well-covered triangulations: Part I

✍ A. Finbow; B. Hartnell; R. Nowakowski; Michael D. Plummer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 764 KB

A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations.

On well-covered triangulations: Part III

✍ Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Constructing a covering triangulation by

Constructing a covering triangulation by means of a nowhere-zero dual flow

✍ André Bouchet 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB