Non-planar apex graphs with different independence properties
DOI10.5281/zenodo.10671321Zenodo10671321MaRDI QIDQ6697162FDOQ6697162
Dataset published at Zenodo repository.
Georg Grasegger, Anthony Nixon, Eleftherios Kastis, Brigitte Servatius, Sean Dewar
Publication date: 16 February 2024
Copyright license: Creative Commons Attribution 4.0 International
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. Independence is considered in the 3-dimensional generic rigidity matroid. 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 at most 3n 6. The data set provides graphs in Graph6 data format.
This page was built for dataset: Non-planar apex graphs with different independence properties
