A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Outerplanarity of line graphs and iterated line graphs
2011
Applied Mathematics Letters
The outerplanar index of a graph G is the smallest integer k such that the kth iterated line graph of G is non-outerplanar. In this note, we show: (i) the characterization of the forbidden subgraphs for graphs with outerplanar line graphs; (ii) that the outerplanar index of a graph is either infinite or at most 3. Furthermore, we give a full characterization of all graphs with respect to their outerplanar index. Crown
doi:10.1016/j.aml.2011.02.011
fatcat:hrjke2llinauzd4yont22ddhtq