Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
