An F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar. © 1973.
Adler, A. (1973). F-Planar graphs. Journal of Combinatorial Theory, Series B, 15(2), 207–210. https://doi.org/10.1016/0095-8956(73)90023-3