Embedding in the Plane With Orientation Constraints: The Angle Graph
β Scribed by PIERRE ROSENSTIEHL
- Book ID
- 119863029
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 261 KB
- Volume
- 555
- Category
- Article
- ISSN
- 0890-6564
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in
## 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