Unavoidable parallel minors of 4-connected graphs


A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a… (More)
DOI: 10.1002/jgt.20361


3 Figures and Tables