Uncountable graphs with all their vertices in one face

Description

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 un countable graphs admitting S-embeddings with all their vertices in the same face (namely, outer-S embeddings).

Additional details