All minimal non-apex graphs with 12 or fewer vertices or 26 or fewer edges are listed, and every 13-vertex graph with minimum degree 6 is shown to be apex or to contain a K6 minor.
The complement problem for linklessly embed- dable graphs.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
New minor minimal non-apex graphs
All minimal non-apex graphs with 12 or fewer vertices or 26 or fewer edges are listed, and every 13-vertex graph with minimum degree 6 is shown to be apex or to contain a K6 minor.