The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs

Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz

We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.