Article
A linear algorithm to recognize maximal generalized outerplanar graphs
Author/s | Cáceres, José
Márquez Pérez, Alberto |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 1997 |
Deposit Date | 2021-06-14 |
Published in |
|
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. |
Citation | Cáceres, J. y Márquez Pérez, A. (1997). A linear algorithm to recognize maximal generalized outerplanar graphs. Mathematica Bohemica, 122 (3), 225-230. |
Files | Size | Format | View | Description |
---|---|---|---|---|
A linear algorithm to recognize ... | 427.1Kb | [PDF] | View/ | |