Robertson's apex graph is the 15-vertex graph 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 vertex which is connected to each degree-3 vertex of the (planar) rhombic
dodecahedral graph, or by contracting two opposite vertices of the tesseract
graph.