Obstruction Sets for Outer-Projective-Planar Graphs

Archdeacon, Dan; Hartsfield, Nora; Little, C.H.C.; Mohar, Bojan

Abstract

References

Ars Combinatoria

Volume 049
Pages: 113-127

Research article

Obstruction Sets for Outer-Projective-Planar Graphs

^¹, ^², ^³, ^⁴

¹ Department of Mathematics and Statistics University of Vermont Burlington, VT, USA 05401-1455

² Department of Mathematics Western Washington University Bellingham, WA, USA 98225

³Department of Mathematics and Statistics Massey University Palmerston North, New Zealand

⁴ Department of Mathematics University of Ljubljana Slovenia

Published: 31/08/1998

Download PDF
Cite

Copyright Link
License

Abstract

A graph $G$ is outer-projective-planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face. We exhibit obstruction sets for outer-projective-planar graphs with respect to the subdivision, minor, and $Y Δ$ orderings. Equivalently, we find the minimal non-outer-projective-planar graphs under these orderings.

Contents

Ars Combinatoria

Obstruction Sets for Outer-Projective-Planar Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP