Small universal graphs for bounded-degree planar graphs
If \(N\), \(k\) are natural numbers, a graph on \(O_k(N)\) vertices is explicitly constructed that embeds every \(N\)-vertex planar graph with maximum degree \(\leq k\).
scientific article; zbMATH DE number 1912032