Bipartite minors
From MaRDI portal
Publication:896000
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.
Recommendations
Cites work
Cited in
(11)- Bipartite and Eulerian minors
- A note on immersion minors and planarity
- Excluded checkerboard colourable ribbon graph minors
- Bipartite rigidity
- Interval minors of complete bipartite graphs
- Bipartite rigidity
- scientific article; zbMATH DE number 4095479 (Why is no real title available?)
- Minors for alternating dimaps
- Extremal embedded graphs
- Recursive characterization of maximal bipartite planar graphs
- Eulerian and even-face ribbon graph minors
This page was built for publication: Bipartite minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896000)