Non-planar (3,6)-sparse graphs with various apex properties

DOI10.5281/zenodo.10671293Zenodo10671293MaRDI QIDQ6697164FDOQ6697164

Dataset published at Zenodo repository.

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

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 (3-6)sparse graphs with different apex properties. A graph is (3,6)-sparse if if for every subset of n vertices,with at least 3 elements, the number of edges in the subgraph induced by these elements is atmost 3n 6. 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 (3,6)-sparse graphs with various apex properties