The antibox graph is the 14-vertex, 21-edge cubic Hamiltonian graph illustrated above. It has girth 4, graph crossing number 2, graph diameter 4, and chromatic number 3. It is also an apex graph.
The antibox graph was defined as an intermediate obstruction in a characterization of highly connected cubic graphs by forbidden topological minors (Robertson et al. 2019). It occurs together with the drape graph, Petersen graph, triplex graph, and box graph in the proof.
The antibox graph is implemented in the Wolfram Language as GraphData["AntiboxGraph"].
