| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650751 | Discrete Mathematics | 2008 | 9 Pages |
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. A non-1-planar graph G is minimal if the graph G-eG-e is 1-planar for every edge e of G . We prove that there are infinitely many minimal non-1-planar graphs (MN-graphs). It is known that every 6-vertex graph is 1-planar. We show that the graph K7-K3K7-K3 is the unique 7-vertex MN-graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vladimir P. Korzhik,