Sciweavers

Share
JCT
2016

Bipartite minors

4 years 4 months ago
Bipartite minors
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 K3,3 as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite (2, 2)-Laman graphs — a certain family of graphs that contains all maximal bipartite planar graphs.
Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella N
Added 06 Apr 2016
Updated 06 Apr 2016
Type Journal
Year 2016
Where JCT
Authors Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour
Comments (0)
books