𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the orientable genus of graphs with bounded nonorientable genus

✍ Scribed by Bojan Mohar

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
396 KB
Volume
182
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorientable embedding is disproved.

πŸ“œ 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

Computing the orientable genus of projec
Computing the orientable genus of projective graphs
✍ J. R. Fiedler; J. P. Huneke; R. B. Richter; N. Robertson πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 603 KB

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

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