𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the orientable genus of projective graphs

✍ Scribed by J. R. Fiedler; J. P. Huneke; R. B. Richter; N. Robertson

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
603 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The orientable genus is determined for any graph that embeds into the projective plane, Σ, to be essentially half of the representativity of any embedding into Σ. In addition, a structure is given for any 3‐connected projective planar graph as the union of a spanning planar graph and a variation of a Möbius Ladder. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

On the orientable genus of graphs embedd
On the orientable genus of graphs embedded in the klein bottle
✍ Neil Robertson; Robin Thomas 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 560 KB

## Abstract Let __G__ be a graph embedded in the Klein bottle with “representativity” at least four. We give a formula for the orientable genus of __G__, which also implies a polynomially bounded algorithm. The formula is in terms of the number of times certain closed curves on the Klein bottle int

The Projective Noether Maple Package: Co
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety
✍ Marc Giusti; Klemens Hägele; Grégoire Lecerf; Joël Marchand; Bruno Salvy 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Recent theoretical advances in elimination theory use straight-line programs as a data structure to represent multivariate polynomials. We present here the Projective Noether Package which is a Maple implementation of one of these new algorithms, yielding as a byproduct a computation of the dimensio