𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular embeddings of coloured digraphs

✍ Scribed by Attilia Ceré

Book ID
104641681
Publisher
Springer
Year
1989
Tongue
English
Weight
450 KB
Volume
29
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

✦ Synopsis

A particular kind of 2-ceU embeddings, called regular, for arc-coloured digraphs is introduced, and a method for constructing both orientable and non-orientable regular embeddings is presented. Furthermore, by using combinatorial concepts and the Euler-Poincar6 formula, we derive upper bounds for both the orientable and non-orientable genera of such arc-coloured digraphs. * Work performed within the project Geometria delle Varieth Differenziabili of the MPI of Italy.

📜 SIMILAR VOLUMES

Maximum diameter of regular digraphs
Maximum diameter of regular digraphs
✍ Josè Soares 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 512 KB

## Abstract We prove that every __r__‐biregular digraph with __n__ vertices has its directed diamter bounded by (3__n__ ‐ __r__ ‐ 3)/(__r__ +1). We show that this bound is tight for directed as well as for undirected graphs. The upper bound remains valid for Eulerian digraphs with minimum outdegree