Minimal reducible bounds for 1-nonouterplanar graphs Original Research Article

We consider a subclass of planar graphs, slightly wider than the class of outerplanar graphs. We prove that for this class of graphs there are infinitely many minimal reducible bounds in contrast with the class of outerplanar graphs, and describe all of them.