Non-separating planar graphs are precisely the graphs without K₁ ∪ K₄, K₁ ∪ K_{2,3}, or K_{1,1,3} as minors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-separating Planar Graphs
Non-separating planar graphs are precisely the graphs without K₁ ∪ K₄, K₁ ∪ K_{2,3}, or K_{1,1,3} as minors.