✦ LIBER ✦

(m)-covering of a triangulation

✍ Scribed by Dominique Benard; Andre Bouchet; Jean-Luc Fouquet

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 631 KB
Volume: 62
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90213-x

No coin nor oath required. For personal study only.

✦ Synopsis

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 of G~m) is possible whenever n is an odd prime and a well separating cycle (mod m) can be determined.

📜 SIMILAR VOLUMES

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

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

Triangulation micrométrique de l'amas 65

Triangulation micrométrique de l'amas 6523 (M. 8).

✍ J. Comas Solà 📂 Article 📅 1899 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

Triangulation — a methodological discuss

Triangulation — a methodological discussion

✍ Martin Oppermann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

Triangulation is starting to emerge in tourism research as the `new' method. However, there are many misconceptions of what triangulation is and what it can do. This paper discusses triangulation as a research method in the social sciences. It re¯ects on the origins of the term and what it currently