All minor-minimal apex obstructions with connectivity two (Q2223478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: All minor-minimal apex obstructions with connectivity two |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All minor-minimal apex obstructions with connectivity two |
scientific article |
Statements
All minor-minimal apex obstructions with connectivity two (English)
0 references
29 January 2021
0 references
Summary: 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.
0 references
apex graphs
0 references
0.8504265546798706
0 references
0.805018424987793
0 references
0.7939209342002869
0 references
0.7884773015975952
0 references
0.7805604338645935
0 references
