All minor-minimal apex obstructions with connectivity two
arXiv:1808.05940 · doi:10.37236/8382
Abstract
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of determining this finite list of apex obstructions remains open. This paper determines the 133 minor-minimal, non-apex graphs that have connectivity two.
57 pages, 62 figures, 1 appendix Near final published version. Note that archive LaTeX processing creates g6 data contain apostrophe error ' should be `