All minor-minimal apex obstructions with connectivity two
Combinatorics
2021-11-29 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1808.05940,
title = {All minor-minimal apex obstructions with connectivity two},
author = {Adam S. Jobson and André E. Kézdy},
journal= {arXiv preprint arXiv:1808.05940},
year = {2021}
}
Comments
57 pages, 62 figures, 1 appendix Near final published version. Note that archive LaTeX processing creates g6 data contain apostrophe error ' should be `