Abstract A graph is 1‐ planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non‐1‐planar graph G is minimal if the graph is 1‐planar for every edge e of G . We construct two infinite families of minimal...
No comments yet
Be the first to share your thoughts!