Obstruction sets for outer-cylindrical graphs
From MaRDI portal
A graph is said to be outer-cylindrical if it can be embedded in the plane in such a way that each vertex lies on the boundary of at least one of two distinguished faces. The class of outer-cylindrical graphs is closed under the taking of minors. NEWLINENEWLINENEWLINEThe authors find a complete set of minimal excluded minors for outer-cylindrical graphs, of which there are 38. They also determine the obstruction sets under other graph orderings.
Recommendations
Cites work
- A kuratowski theorem for the projective plane
- Disjoint homotopic paths and trees in a planar graph
- Graph minors. XX: Wagner's conjecture
- NETPAD: An interactive graphics system for network modeling and optimization
- On obstructions to small face covers in planar graphs
- On the Complexity of Covering Vertices by Faces in a Planar Graph
Cited in
(8)- Halin's theorem for cubic graphs on an annulus
- Non-separating planar graphs
- Four-searchable biconnected outerplanar graphs
- Variations on a theme of Kuratowski
- Obstruction sets for outer-projective-planar graphs
- Outerplanarity without accumulation in the cylinder and the Möbius band
- scientific article; zbMATH DE number 2192139 (Why is no real title available?)
- Survey article: consequences of some outerplanarity extensions
This page was built for publication: Obstruction sets for outer-cylindrical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746484)