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

arxiv: 1507.06800 · v2 · pith:C2S2MJXXnew · submitted 2015-07-24 · 🧮 math.CO · cs.DM

The Characterization of planar, 4-connected, K_(2,5)-minor-free graphs

Emily Abernethy Marshall , Liana Yepremyan , Zach Gaslowitz This is my paper

classification 🧮 math.CO cs.DM

keywords connectedplanarcharacterizationcycleeveneveryfreegraph

0 comments

read the original 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.

This paper has not been read by Pith yet.