Obstruction sets for outer-cylindrical graphs (Q2746484)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1656148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obstruction sets for outer-cylindrical graphs |
scientific article; zbMATH DE number 1656148 |
Statements
Obstruction sets for outer-cylindrical graphs (English)
0 references
9 October 2002
0 references
outer-cylindrical graph
0 references
excluded minor
0 references
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.
0 references
0.7951295971870422
0 references
0.770139753818512
0 references
0.7268692255020142
0 references
