Non-planar graphs with various apex properties

DOI10.5281/zenodo.10671129Zenodo10671129MaRDI QIDQ6697166FDOQ6697166

Dataset published at Zenodo repository.

Brigitte Servatius, Anthony Nixon, Georg Grasegger, Sean Dewar, Eleftherios Kastis

Publication date: 16 February 2024

Copyright license: Creative Commons Attribution 4.0 International

Description

In this data set we provide the list of non-planar connected graphs with different apex properties. We call a graph apex if there is a vertex whose deletion gives a planar graph. A graph is critically apex if the deletion of every single vertex yields a planar graph. Similarly (critically) edge-apex graphs are defined with the deletion of edges. Furthermore, k-apex and k-edge-apex graphs are defined by deleting k vertices or edges. The data set provides graphs in Graph6 data format.

This page was built for dataset: Non-planar graphs with various apex properties