Is there a specific implementation checking if the clique on 7 vertices $K_7$ is a minor of a given graph?
SAGE proposes a method but it's very slow. There is a linear-time algorithm for checking $K_5$-minor free graphs, is there something for $K_7$? Implemented?