| C.H.C. Little D. Archdeacon, N. Hartsfield and B. Mohar. Obstruction sets for outer-projective-planar graphs. Ars Combinatoria, 49:113--127, 1998. |
....graphs to show that 35 of those graphs are minor minimal non outer projective planar graphs. They searched the list of subdivision minimal non projective planar graphs for the graphs which possessed a vertex v 2 G such that G Gamma v is also a minor minimal non projective planar graph [8]. Herein lies another method for determining the obstruction set. One can find the members of a graph class, H, obstruction set by searching the known obstruction set a larger graph class, G, where H ae G. 3.4 Computing Obstruction Sets Courcelle conjectured and later proved a result that was ....
C.H.C. Little D. Archdeacon, N. Hartsfield and B. Mohar. Obstruction sets for outer-projective-planar graphs. Ars Combinatoria, 49:113--127, 1998.
....is possible to show that a graph is minor minimal non outer projective planar only if it is a single vertex deleted subgraph of a minor minimal non projectiveplanar graph. The minor minimal non projective planar graphs were found by Archdeacon (see [2] for an announcement, 1] for the proof, and [3] for pictures of the graphs) Using this set she found the complete set of minorminimal non outer projective planar graphs. This independently veri ed the results in [3] A graph is 1 cylindrical if it embeds in the plane such that all vertices are on the boundary of two distinguished faces, and ....
....The minor minimal non projective planar graphs were found by Archdeacon (see [2] for an announcement, 1] for the proof, and [3] for pictures of the graphs) Using this set she found the complete set of minorminimal non outer projective planar graphs. This independently veri ed the results in [3]. A graph is 1 cylindrical if it embeds in the plane such that all vertices are on the boundary of two distinguished faces, and those faces share at least one boundary point. If a graph is 1 cylindrical, then it is outer projective planar (sew a crosscap on at the common boundary point) Using ....
D. Archdeacon, N. Hartsfield, C.H.C. Little, and B. Mohar, Obstructions sets for outer-projective-planar graphs, Ars Combinatoria to appear.
....is possible to show that a graph is minor minimal non outer projective planar only if it is a single vertex deleted subgraph of a minor minimal non projectiveplanar graph. The minor minimal non projective planar graphs were found by Archdeacon (see [2] for an announcement, 1] for the proof, and [3] for pictures of the graphs) Using this set she found the complete set of minorminimal non outer projective planar graphs. This independently verified the results in [3] A graph is 1 cylindrical if it embeds in the plane such that all vertices are on the boundary of two distinguished faces, and ....
....The minor minimal non projective planar graphs were found by Archdeacon (see [2] for an announcement, 1] for the proof, and [3] for pictures of the graphs) Using this set she found the complete set of minorminimal non outer projective planar graphs. This independently verified the results in [3]. A graph is 1 cylindrical if it embeds in the plane such that all vertices are on the boundary of two distinguished faces, and those faces share at least one boundary point. If a graph is 1 cylindrical, then it is outer projective planar (sew a crosscap on at the common boundary point) Using ....
D. Archdeacon, N. Hartsfield, C.H.C. Little, and B. Mohar, Obstructions sets for outer-projective-planar graphs, Ars Combinatoria to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC