Location of Repository

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs

By R.C. Laskar, H.M. Mulder and B. Novick


Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices, two of these being adjacent whenever as triangles in $G$ they share an edge. A graph is edge-triangular if every edge is in at least one triangle. The main results can be summarized as follows: the class of maximal outerplanar graphs is precisely the intersection of any of the two following classes: the chordal graphs, the path-neighborhood graphs, the edge-triangular graphs having a tree as triangle graph.maximal outerplanar graph;path-neighborhood graph;triangle graph;chordal graph;elimination ordering

OAI identifier:

Suggested articles



  1. (2004). Algorithmic Graph Theory and Perfect Graphs. Second edition,
  2. (1977). Algorithms on trees and maximal outerplanar graphs: design, complexity analysis and data structures study,
  3. (1969). Graph Theory, Addison-Wesley,
  4. (1979). Linear algorithms to recognize outerplanar and maximal outerplanar graphs,
  5. (1979). Minimum dominating cycles in 2-trees,
  6. (2004). On 3-simplicial vertices in planar graphs,
  7. (1961). On rigid circuit graphs ABh.
  8. (1974). Outerplanar graphs and weak duals.
  9. (1997). Outerplanarity without topology,
  10. Path-neighborhood graphs, preprint, EI-Report EI 2010-64, Econometrisch Instituut, Erasmus Universiteit,
  11. (1967). Planar permutation graphs,
  12. (1985). Sys lo, Interior graphs of maximal outerplane graphs
  13. (1991). Triangle graphs,
  14. (1998). Triangle graphs, in: Graph connections (Cochin,
  15. Triangle-graphs, EI-Report EI 2009-42, Econometrisch Instituut, Erasmus Universiteit,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.