A Characterization of Almost-Planar Graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- Six variations on a theme: almost planar graphs
- On almost-planar graphs
- A characterization of level planar graphs
- An algorithm for delta-wye reduction of almost-planar graphs
- Non-separating planar graphs
- All minor-minimal apex obstructions with connectivity two
- Delta-wye transformations and the efficient reduction of almost-planar graphs
- Graph operations and neighborhood polynomials
- Minors in large almost-5-connected non-planar graphs
- Non-planar extensions of subdivisions of planar graphs
- scientific article; zbMATH DE number 3985813 (Why is no real title available?)
- scientific article; zbMATH DE number 4010536 (Why is no real title available?)
- scientific article; zbMATH DE number 4041968 (Why is no real title available?)
- scientific article; zbMATH DE number 139915 (Why is no real title available?)
- Planar graphs producing no strongly almost trivial embedding
- Delta-wye reduction of almost-planar graphs
- A characterization of ?-outerplanar graphs
- On the Characterization of Plane Bus Graphs
- A characterization of graphs which can be approximated in area by smooth graphs
- Forbidden minors: finding the finite few
- Almost-graphic matroids
This page was built for publication: A Characterization of Almost-Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715268)