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.











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)