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

Emily Abernethy Marshall; Liana Yepremyan; Zach Gaslowitz

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

Combinatorics 2015-08-24 v2 Discrete Mathematics

Authors: Emily Abernethy Marshall , Liana Yepremyan , Zach Gaslowitz

View on arXiv ↗ PDF ↗

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.

Keywords

planar graphs 4-connected graphs K_{2,5}-minor-free square of a cycle graph characterization

Cite

@article{arxiv.1507.06800,
  title  = {The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs},
  author = {Emily Abernethy Marshall and Liana Yepremyan and Zach Gaslowitz},
  journal= {arXiv preprint arXiv:1507.06800},
  year   = {2015}
}