Bipartite Minors
Combinatorics
2013-12-03 v1
Abstract
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite -Laman graphs --- a certain family of graphs that contains all maximal bipartite planar graphs.
Cite
@article{arxiv.1312.0210,
title = {Bipartite Minors},
author = {Maria Chudnovsky and Gil Kalai and Eran Nevo and Isabella Novik and Paul Seymour},
journal= {arXiv preprint arXiv:1312.0210},
year = {2013}
}
Comments
9 pages