Summary
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).
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boza, L., Fedriani, E. & Núńez, J. Uncountable graphs with all their vertices in one face. Acta Math Hung 112, 307–313 (2006). https://doi.org/10.1007/s10474-006-0082-0
Issue Date:
DOI: https://doi.org/10.1007/s10474-006-0082-0