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) |
| Date | 1997 |
| 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/ | |
https://hdl.handle.net/11441/111753
https://doi.org/10.21136/MB.1997.126148This item appears in the following collection(s)
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional