Premium
A characterization of α‐outerplanar graphs
Author(s) -
Wargo Lawrence
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199609)23:1<57::aid-jgt7>3.0.co;2-j
Subject(s) - mathematics , combinatorics , outerplanar graph , characterization (materials science) , graph , discrete mathematics , pathwidth , line graph , optics , physics
Chartrand and Harary have shown that if G is a non‐outerplanar graph such that, for every edge e, both the deletion G \ e and the contraction G / e of e from G are outerplanar, then G is isomorphic to K 4 or K 2,3 . An α‐outerplanar graph is a graph which is not outerplanar such that, for some edge α, both G \α and G /α are outerplanar. We describe various results for the class of α‐outerplanar graphs and obtain a characterization of the class. © 1996 John Wiley & Sons, Inc.