Geodesic
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 provenant de la source Czech Digital Mathematics Library

MR Zbl
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.
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
Keywords: outerplanar graph; generalized outerplanar graph 
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
@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},
     year = {1997},
     volume = {122},
     number = {3},
     doi = {10.21136/MB.1997.126148},
     mrnumber = {1600871},
     zbl = {0898.05017},
     language = {en},
     url = {http://geodesic.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
UR  - http://geodesic.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
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126148/
%R 10.21136/MB.1997.126148
%G en
%F 10_21136_MB_1997_126148

[1] F. Hаrаry: Graph Theory. Addison Wesley, Reading Mass., 1969. | MR

[2] J. E. Hopcroft аnd R. E. Tаrjаn: Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973), 135-158. | DOI | MR

[3] M. C. vаn Lier аnd R. H. J. M. Otten: C.A.D. of masks and wiring. T. H. Rept. 74-E-44, Dept. Elect. Engrg. Eindhoven University of Technology.

[4] S. Mitchell: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett. 9 (1979), 229-232. | DOI | MR | Zbl

[5] T. Nishizeki N. Chibа: Planar Graphs: Theory and Algoгithms. North-Holland, Amsterdam, 1969.

[6] J. Sedláček: On a generalization of outerplanar graphs. Časopis Pěst. Mat. 113 (1988) 213-218. | MR

[7] W. T. Tutte: A theory of 3-connected graphs. Indag. Math. 23 (1961), 441-455. | MR | Zbl

Cité par Sources :