A linear algorithm to recognize maximal generalized outerplanar graphs
Mathematica Bohemica, Tome 122 (1997) no. 3, pp. 225-230.

Voir la notice de l'article dans Czech Digital Mathematics Library

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.
DOI : 10.21136/MB.1997.126148
Classification : 05C10, 05C75, 05C85
Mots-clés : outerplanar graph; generalized outerplanar graph
@article{10_21136_MB_1997_126148,
     author = {C\'aceres, Jos\'e and M\'arquez, Alberto},
     title = {A linear algorithm to recognize maximal generalized outerplanar graphs},
     journal = {Mathematica Bohemica},
     pages = {225--230},
     publisher = {mathdoc},
     volume = {122},
     number = {3},
     year = {1997},
     doi = {10.21136/MB.1997.126148},
     mrnumber = {1600871},
     zbl = {0898.05017},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.21136/MB.1997.126148/}
}
TY  - JOUR
AU  - Cáceres, José
AU  - Márquez, Alberto
TI  - A linear algorithm to recognize maximal generalized outerplanar graphs
JO  - Mathematica Bohemica
PY  - 1997
SP  - 225
EP  - 230
VL  - 122
IS  - 3
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/articles/10.21136/MB.1997.126148/
DO  - 10.21136/MB.1997.126148
LA  - en
ID  - 10_21136_MB_1997_126148
ER  - 
%0 Journal Article
%A Cáceres, José
%A Márquez, Alberto
%T A linear algorithm to recognize maximal generalized outerplanar graphs
%J Mathematica Bohemica
%D 1997
%P 225-230
%V 122
%N 3
%I mathdoc
%U https://geodesic-test.mathdoc.fr/articles/10.21136/MB.1997.126148/
%R 10.21136/MB.1997.126148
%G en
%F 10_21136_MB_1997_126148
Cáceres, José; Márquez, Alberto. A linear algorithm to recognize maximal generalized outerplanar graphs. Mathematica Bohemica, Tome 122 (1997) no. 3, pp. 225-230. doi : 10.21136/MB.1997.126148. https://geodesic-test.mathdoc.fr/articles/10.21136/MB.1997.126148/

Cité par Sources :