The connectivity of minimal imperfect graphs
Andr�s Seb� · Journal of Graph Theory · 1996
We prove that partitionable graphs are 2o − 2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2o − 2. The proof of the connectivity result is a simple linear algebraic proof. © 1996 John Wiley & Sons, Inc.