ON HAMILTONIAN LINE GRAPHS AND CONNECTIVITY

被引：65

作者：

ZHAN, SM

机构：

[1] Department of Mathematics and Statistics, Simon Fraser University

来源：

DISCRETE MATHEMATICS | 1991年 / 89卷 / 01期

关键词：

D O I：

10.1016/0012-365X(91)90401-M

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A well-known conjecture of Thomassen says that every 4-connected line graph is hamiltonian. In this paper we prove that every 7-connected line graph is hamiltonian-connected.

引用

页码：89 / 95

页数：7

共 13 条

[1]

ALSPACH B, 1985, ANN DISCRETE MATH, V27, P463

[2]

BERMOND JC, 1978, SELECTED TOPICS GRAP, P127

[3]

BERMOND JC, 1981, J GRAPH THEOR, V5, P12

[4]

BONDY JA, 1980, GRAPH THEORY APPLICA

[5] ON HAMILTONIAN LINE GRAPHS [J].

CLARK, L .

JOURNAL OF GRAPH THEORY, 1984, 8 (02) :303-307

[6]

Clark L.K., 1983, ARS COMBINATORIA, V15, P131

[7]

Harary F., 1965, CANAD MATH B, V8, P701

[8]

HEMMINGER RL, 1978, SELECTED TOPICS GRAP, P127

[9] LONGEST CYCLES IN R-REGULAR R-CONNECTED GRAPHS [J].

JACKSON, B ;

PARSONS, TD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 32 (03) :231-245

[10] HAMILTONIAN RESULTS IN K1,3 FREE GRAPHS [J].

MATTHEWS, MM ;

SUMNER, DP .

JOURNAL OF GRAPH THEORY, 1984, 8 (01) :139-146

← 1 2 →