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 条

[11] SQUARE OF GRAPHS, HAMILTONICITY AND PANCYCLICITY, HAMILTONIAN CONNECTEDNESS AND PANCONNECTEDNESS ARE EQUIVALENT CONCEPTS [J].

FLEISCHNER, H .

MONATSHEFTE FUR MATHEMATIK, 1976, 82 (02) :125-149

[12] FORBIDDEN SUBGRAPHS AND HAMILTONIAN PROPERTIES IN THE SQUARE OF A CONNECTED GRAPH [J].

GOULD, RJ ;

JACOBSON, MS .

JOURNAL OF GRAPH THEORY, 1984, 8 (01) :147-154

[13] TRAVERSABILITY AND CONNECTIVITY OF MIDDLE GRAPH OF A GRAPH [J].

HAMADA, T ;

YOSHIMURA, I .

DISCRETE MATHEMATICS, 1976, 14 (03) :247-255

[14] TREES WITH HAMILTONIAN SQUARE [J].

HARARY, F ;

SCHWENK, A .

MATHEMATIKA, 1971, 18 (35) :138-&

[15]

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

[16]

MATTHEWS M, 82004 U S CAR DEP CO

[17]

Nebesky L., 1973, COMMENT MATH U CAROL, V14, P107

[18]

NEBESKY L, 1973, CASOPIS PEST MAT, V98, P285

[19] EVERY CONNECTED, LOCALLY CONNECTED NONTRIVIAL GRAPH WITH NO INDUCED CLAW IS HAMILTONIAN [J].

OBERLY, DJ ;

SUMNER, DP .

JOURNAL OF GRAPH THEORY, 1979, 3 (04) :351-356

[20] STRONG PERFECT-GRAPH CONJECTURE IS TRUE FOR K1,3-FREE GRAPHS [J].

PARTHASARATHY, KR ;

RAVINDRA, G .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 21 (03) :212-223

← 1 2 3 →