Uncountable graphs with all their vertices in one face (Q858133)

This paper gives a characterization of infinite (not necessarily countable) graphs which are outerplanar, i.e., which admit an embedding into the plane where all vertices are on the boundary of one component of the complement in the plane. One of the equivalent conditions is the combination of the following three properties: the graph is planar, every finite subgraph is outerplanar, and the graph has at most \(\aleph_0\) different cycles. A similar characterization is valid for infinite graphs admitting an embedding into a given closed surface.