𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonorientable genus of nearly complete bipartite graphs

✍ Scribed by Bojan Mohar

Publisher
Springer
Year
1988
Tongue
English
Weight
524 KB
Volume
3
Category
Article
ISSN
0179-5376

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