𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the non-orientable genus of a 2-connected graph

✍ Scribed by R.Bruce Richter

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
589 KB
Volume
43
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the maximum genus of a graph
On the maximum genus of a graph
✍ E.A Nordhaus; B.M Stewart; A.T White πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 415 KB
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

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.