Published February 16, 2024
| Version v1
Dataset
Open
Non-planar (3,6)-sparse graphs with various apex properties
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 at most 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.
Files
NonPlanarD3L6SparseApexGraphsV6-10.zip
Files
(152.5 MB)
Name | Size | Download all |
---|---|---|
md5:37d124acece757e10a12b51566fa346a
|
22.7 MB | Preview Download |
md5:b11b6cbd92694be7ca7189060282c4ba
|
38.4 kB | Preview Download |
md5:d4c38f103a2d013273b76e87813491c0
|
1.5 kB | Preview Download |
md5:d204c31387211cad42da286d82bec3dd
|
490.3 kB | Preview Download |
md5:c69395750c292ac796eff3ffa0cd5a6b
|
3.3 kB | Preview Download |
md5:a84a91c0661ed4ea384136561ebcfbab
|
3.2 MB | Preview Download |
md5:6166b7027ce517048f8350b08aec8e5d
|
12.6 kB | Preview Download |
md5:d01ec133a83a8ab4b443f9f72371f659
|
12.3 MB | Preview Download |
md5:f903c8b2ef585ea6a15c1a269847e1fa
|
29.9 MB | Preview Download |
md5:b3c015d6d5a89263ae29e5bbb19411af
|
24.5 MB | Preview Download |
md5:c2196f8195138483c463e9f330dc8573
|
29.9 MB | Preview Download |
md5:11f7a1eee7ef3ffe3e1768c6ed504edf
|
29.3 MB | Preview Download |