Robertson's Apex Graph
RobertsonsApexGraph
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 YDeltaY-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.
See also
Apex Graph, Petersen Family Graphs, Robertson GraphExplore with Wolfram|Alpha
WolframAlpha
More things to try:
Cite this as:
Weisstein, Eric W. "Robertson's Apex Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/RobertsonsApexGraph.html