The corresponding theorem is as follows. A graph is planar iff 1. it has at most continuum many vertices, 2. it has at most countably many vertices with degree 3 or more, 3. it does not have a topological K5 or K3,3.     