The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
math.CO↗
arXiv subjects
Emily Abernethy Marshall
Publications and source records attributed to Emily Abernethy Marshall.