The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs
arXiv:1507.06800
Abstract
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
6 pages
arXiv:1507.06800
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
6 pages