| Titel | Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs |
|---|---|
| Gepubliceerd in | Report / Econometric Institute, Erasmus University Rotterdam, p.1-12. ISSN 1566-7294. |
| Auteur | Laskar, R.C. (R.C.); Mulder, H.M. (Henry); Novick, B. B. (Beth) |
| Datum | 2011-06-07 |
| Trefwoord(en) | maximal outerplanar graph, path-neighborhood graph, triangle graph, chordal graph, elimination ordering |
| Taal | Engels |
| Type | working paper |
| Uitgever | Econometric Institute |
| Samenvatting | 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. |
| Publicatie | http://hdl.handle.net/1765/23560 |
| Persistent Identifier | urn:NBN:nl:ui:15-1765/23560 |
| Metadata | XML |
| Repository | Erasmus Universiteit Rotterdam |
Omhoog
Ga terug naar de inhoud
Ga terug naar de site navigatie