arXiv Analytics

Sign in

arXiv:1507.06800 [math.CO]AbstractReferencesReviewsResources

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

Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz

Published 2015-07-24Version 1

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

Comments: 6 pages
Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:math/0411356 [math.CO] (Published 2004-11-16)
Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs
arXiv:0802.2980 [math.CO] (Published 2008-02-21)
Characterization of Cobweb Posets as KoDAGs
arXiv:1303.3674 [math.CO] (Published 2013-03-15)
A characterization of triangulations of closed surfaces

Links

Toolbox