The drape 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 drape graph was defined in a study of excluded minors in cubic graphs. Every cyclically five-connected cubic graph containing the drape graph as a topological minor also contains at least one of the Petersen graph, triplex graph, box graph, or antibox graph as a topological minor (Robertson et al. 2019).
The drape graph is implemented in the Wolfram Language as GraphData["DrapeGraph"].
