A linear algorithm to recognize maximal generalized outerplanar graphs

José Cáceres; Alberto Márquez

Mathematica Bohemica (1997)

  • Volume: 122, Issue: 3, page 225-230
  • ISSN: 0862-7959

Abstract

top
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.

How to cite

top

Cáceres, José, and Márquez, Alberto. "A linear algorithm to recognize maximal generalized outerplanar graphs." Mathematica Bohemica 122.3 (1997): 225-230. <http://eudml.org/doc/248154>.

@article{Cáceres1997,
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.},
author = {Cáceres, José, Márquez, Alberto},
journal = {Mathematica Bohemica},
keywords = {outerplanar graph; generalized outerplanar graph; outerplanar graph; generalized outerplanar graph},
language = {eng},
number = {3},
pages = {225-230},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A linear algorithm to recognize maximal generalized outerplanar graphs},
url = {http://eudml.org/doc/248154},
volume = {122},
year = {1997},
}

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
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 122
IS - 3
SP - 225
EP - 230
AB - 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.
LA - eng
KW - outerplanar graph; generalized outerplanar graph; outerplanar graph; generalized outerplanar graph
UR - http://eudml.org/doc/248154
ER -

References

top
  1. F. Hаrаry, Graph Theory, Addison Wesley, Reading Mass., 1969. (1969) MR0256911
  2. J. E. Hopcroft аnd R. E. Tаrjаn, 10.1137/0202012, SIAM J. Comput. 2 (1973), 135-158. (1973) MR0327391DOI10.1137/0202012
  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, 10.1016/0020-0190(79)90075-9, Inform. Process. Lett. 9 (1979), 229-232. (1979) Zbl0444.68055MR0552536DOI10.1016/0020-0190(79)90075-9
  5. T. Nishizeki N. Chibа, Planar Graphs: Theory and Algoгithms, North-Holland, Amsterdam, 1969. (1969) 
  6. J. Sedláček, On a generalization of outerplanar graphs, Časopis Pěst. Mat. 113 (1988) 213-218. (1988) MR0949046
  7. W. T. Tutte, A theory of 3-connected graphs, Indag. Math. 23 (1961), 441-455. (1961) Zbl0101.40903MR0140094

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.