Topological containment of the 5-clique minus an edge in 4-connected graphs

Rebecca Robinson, Graham Farr

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-tr…