𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive constructions for triangulations

✍ Scribed by M. J. Grannell; T. S. Griggs; J. Širáň

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
190 KB
Volume
39
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2) non‐isomorphic face 2‐colourable triangulations of K~n~ and K~n,n,n~ in orientable and non‐orientable surfaces for values of n lying in certain residue classes and for appropriate constants a. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 87–107, 2002

📜 SIMILAR VOLUMES

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

Some recursive constructions for perfect
Some recursive constructions for perfect hash families
✍ M. Atici; S. S. Magliveras; D. R. Stinson; W.-D. Wei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

An (n, m, w)-perfect hash family is a set of functions F such that f : (1

Recursive constructions for optimal (n,4
Recursive constructions for optimal (n,4,2)-OOCs
✍ Wensong Chu; Charles J. Colbourn 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract In [3], a general recursive construction for optical orthogonal codes is presented, that guarantees to approach the optimum asymptotically if the original families are asymptotically optimal. A challenging problem on OOCs is to obtain optimal OOCs, in particular with λ > 1. Recently we

Recursive constructions for difference m
Recursive constructions for difference matrices and relative difference families
✍ Marco Buratti 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n1 , n2 , . . . , nt) there exists a (G, p e , 1) difference matrix with e = Σ i n i m ax i n i . Also,

A recursive method for construction of d
A recursive method for construction of designs
✍ D.K. Ray-Chaudhuri; Tianbao Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Ray-Chaudhuri, D.K., T. Zhu, A recursive method for construction of designs, Discrete Mathematics 106/107 (1992) 399-406. In this paper, we generalize Blanchard and Narayani's constructions of designs in the following ways. (1) By applying an orthogonal array to the construction, we can reduce the