Obstruction sets for outer-projective-planar graphs (Q2713608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Obstruction sets for outer-projective-planar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Obstruction sets for outer-projective-planar graphs |
scientific article |
Statements
10 June 2001
0 references
outer-projective-planar graph
0 references
minor order
0 references
subdivision order
0 references
\(Y\Delta \) order
0 references
Obstruction sets for outer-projective-planar graphs (English)
0 references
A graph is outer-projective-planar if it can be embedded in the projective plane so that all vertices lie on the boundary of a single face. A set of 103 subdivision-minimal non-projective-planar graphs was found by \textit{H. H. Glover, J. P. Huneke} and \textit{C. S. Wang} [J. Comb. Theory, Ser. B 27, 332-370 (1979; Zbl 0352.05027)] and its completeness was proven by \textit{D. Archdeacon} [J. Graph Theory 5, 243-246 (1981; Zbl 0464.05028)]. This paper deals with obstruction sets for outer-projective-planar graphs, with respect to subdivision ordering, minor ordering and \(Y\Delta \) ordering of graphs. The obstruction sets have 45, 32 and 9 graphs, respectively.
0 references
