Minors of quasi 4-connected graphs (Q1318814): Difference between revisions

A quasi 4-connected graph is a 3-connected graph with no nontrivial 3- separators. Herein a nontrivial 3-separator is a minimal point disconnecting set \(S\) of cardinality 3 such that the connected components of \(G-S\) can be partitioned into two sets both with at least two points. Some results on minors of quasi 4-connected graphs are proved, which have some well-known results as corollaries.