| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650105 | Discrete Mathematics | 2008 | 4 Pages |
Abstract
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either infinite or it is at most 4. Moreover, we give a full characterization of all graphs with respect to their line index.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mohammad Ghebleh, Mahdad Khatirinejad,