𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonorientable genus of cartesian products of regular graphs

✍ Scribed by Tomaž Pisanski

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
565 KB
Volume
6
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian products of triangle‐free graphs to be computed.

📜 SIMILAR VOLUMES

Blocks and the nonorientable genus of gr
Blocks and the nonorientable genus of graphs
✍ Saul Stahl; Lowell W. Beineke 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract Examples are given to show that the nonorientable genus of a graph is not additive over its blocks. A nonorientable analog for the Battle, Harary, Kodama, and Youngs Theorem is proved; this completely determines the nonorientable genus of a graph in terms of its blocks. It is also shown

Tutte's 5-flow conjecture for graphs of
Tutte's 5-flow conjecture for graphs of nonorientable genus 5
✍ Steffen, Eckhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

We develop four constructions for nowhere-zero 5-flows of 3-regular graphs that satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-Flow Conjecture is of order 244 and therefore every bridgeless graph of nonorientable genus 5 5 has a nowhere

Embedding Cartesian Products of Graphs i
Embedding Cartesian Products of Graphs into de Bruijn Graphs
✍ Thomas Andreae; Michael Nölle; Gerald Schreiber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 172 KB

## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 × • • • × G m which are relevant for parallel computing, namely, to