Robertson's apex graph is the graph on 15 vertices illustrated above constructed by Neil Robertson as an example of an apex
graph that is not 
-reducible.
The graph may be constructed by adding an apex graph vertex which is connected to each graph vertex of vertex degree 3 of the (planar) rhombic dodecahedral graph, or by contracting two opposite vertices of the tesseract graph.
