𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The nonorientable genus of the symmetric quadripartite graph

✍ Scribed by M Jungerman

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
283 KB
Volume
26
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

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

Nonorientable genus of cartesian product
Nonorientable genus of cartesian products of regular graphs
✍ TomaΕΎ Pisanski πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 565 KB

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

The nonorientable genus is additive
The nonorientable genus is additive
✍ Dan Archdeacon πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 816 KB

A graph G is a k-amalgamation of two graphs G1 and G2 if G = G, U G2 and G1 fl G2 is a set of k vertices. In this paper we show that +(GI differs from +(G1) + j4G2) by at most a quadratic on k, where denotes the nonorientable genus of a graph. In the sequel to this paper we show that no such bound h