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 Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs.
In this note we show that -skeletons and -skeletons of -pseudomanifolds with full boundary are -connected graphs and -connected -complexes, respectively. This generalizes previous results due to Barnette and Woon.
Page 1