Jose Caceres, Geometria y Topologia, Universidad de Almeria, 04120 Almeria, Spain, e-mail: jcaceres@ualm.es; Alberto Marquez, Matematica Aplicada I, Universidad de Sevilla, 41012 Sevilla, Spain, e-mail: almar@obelix.cica.es
Abstract: In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.
Keywords: outerplanar graph, generalized outerplanar graph
Classification (MSC 1991): 05C10, 05C75
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
