EVERY 4-CONNECTED LINE GRAPH OF A PLANAR GRAPH IS HAMILTONIAN

被引：8

作者：

LAI, HJ ^{[1
]}

机构：

[1] W VIRGINIA UNIV,DEPT MATH,MORGANTOWN,WV 26506

来源：

GRAPHS AND COMBINATORICS | 1994年 / 10卷 / 03期

关键词：

D O I：

10.1007/BF02986673

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph with E(G) not-equal empty set. The line graph of G, written L(G), has E(G) as its vertex set, where two vertices are adjacent in L(G) if and only if the corresponding edges are adjacent in G. Thomassen conjectured that all 4-connected line graphs are hamiltonian [2]. We show that this conjecture holds for planar graphs.

引用

页码：249 / 253

页数：5