HAMILTONIAN RESULTS IN K1,3 FREE GRAPHS

被引：190

作者：

MATTHEWS, MM

SUMNER, DP

机构：

来源：

JOURNAL OF GRAPH THEORY | 1984年 / 8卷 / 01期

关键词：

D O I：

10.1002/jgt.3190080116

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：139 / 146

页数：8

共 23 条

[1] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF A GRAPH [J].

ALLAN, RB ;

LASKAR, R .

DISCRETE MATHEMATICS, 1978, 23 (02) :73-76

[2] TOTAL GRAPHS AND TRAVERSABILITY [J].

BEHZAD, M ;

CHARTRAN.G .

PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 1966, 15 :117-&

[3]

Behzad M., 1971, INTRO THEORY GRAPHS

[4]

CHVATAL V, 1973, DISCRETE MATH, V2, P215

[5]

Chvatal V., 1972, DISCRETE MATH, V2, P111, DOI [DOI 10.1016/0012-365X(72)90079-9, 10.1016/0012-365X(72)90079-9]

[6]

Duke R.A., 1972, DISCRETE MATH, V2, P199

[7] SQUARE OF A BLOCK IS STRONGLY PATH CONNECTED [J].

FAUDREE, RJ ;

SCHELP, RH .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (01) :47-61

[8]

Fleischner H., 1974, Journal of Combinatorial Theory, Series B, V16, P29, DOI 10.1016/0095-8956(74)90091-4

[9] NECESSARY CONDITION FOR SQUARE OF A GRAPH TO BE HAMILTONIAN [J].

FLEISCHNER, H ;

HOBBS, AM .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 19 (02) :97-118

[10] HAMILTONIAN TOTAL GRAPHS [J].

FLEISCHNER, H ;

HOBBS, AM .

MATHEMATISCHE NACHRICHTEN, 1975, 68 :59-82

← 1 2 3 →