Uncountable graphs with all their vertices in one face
- 28 Downloads
In 1967, Chartrand and Harary characterized finite outer-planar graphs, and Wagner studied uncountable graphs admitting a planar embedding. We continue this research for those outer-S graphs in surfaces S by studying uncountable graphs admitting S-embeddings with all their vertices in the same face (namely, outer-S embeddings).
Unable to display preview. Download preview PDF.