Every 4-Connected Line Graph of a Planar Graph is Hamiltonian
- 80 Downloads
Let G be a graph withE(G) $#x2260;ø. The line graph of G, written L(G) hasE(G) as its vertex set, where two vertices are adjacent in L(G) if and only if the corresponding edges are adjacent inG. Thomassen conjectured that all 4-connected line graphs are hamiltonian . We show that this conjecture holds for planar graphs.
KeywordsPlanar Graph Line Graph Hamilton Cycle Internal Vertex Complete Subgraph
Unable to display preview. Download preview PDF.
- 1.Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier New York (1976)Google Scholar