Sedláček, Jiří On a generalization of outerplanar graphs. (Czech. Russian, English summaries) Zbl 0649.05028 Čas. Pěstování Mat. 113, No. 2, 213-218 (1988). A planar graph is said to be a generalized outerplanar graph if it has an embedding in the plane in which every edge is incident to a vertex laying on the boundary of the outer face. The author presents a characterization of generalized outerplanar graphs by means of a set of exactly 12 forbidden subgraphs (up to homeomorphism). Reviewer: J.Širáň Cited in 1 ReviewCited in 2 Documents MSC: 05C10 Planar graphs; geometric and topological aspects of graph theory Keywords:planar graph; generalized outerplanar graph; forbidden subgraphs PDF BibTeX XML Cite \textit{J. Sedláček}, Čas. Pěstování Mat. 113, No. 2, 213--218 (1988; Zbl 0649.05028) OpenURL