Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DM
2008

favoriteEmaildiscussreport

111views more DM 2008»

Planarity of iterated line graphs

13 years 4 months ago

Planarity of iterated line graphs

Download users.tkk.fi

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 innite or it is at most 4. Moreover, we give a full characterization of all graphs with respect to their line index. Key words: Line graph, Planarity

Mohammad Ghebleh, Mahdad Khatirinejad

Real-time Traffic

DM 2008 | Line Graph | Line Index | The Line |

claim paper

Related Content

» Minimizing the Area for Planar StraightLine Grid Drawings

» StraightLine Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

» Straight line embeddings of cubic planar graphs with integer edge lengths

» A pointplacement strategy for conforming Delaunay tetrahedralization

» Maximum Degree Growth of the Iterated Line Graph

» TriEdgeConnectivity Augmentation for Planar Straight Line Graphs

» Encompassing colored planar straight line graphs

» On Stable Cutsets in ClawFree Graphs and Planar Graphs

» Computing Acute and Nonobtuse Triangulations

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Mohammad Ghebleh, Mahdad Khatirinejad

Comments (0)