Polyhedral graphs without Hamiltonian cycles

被引：2

作者：

Walther, H

机构：

[1] Technical University of Ilmenau, D-98693 Ilmenau

来源：

关键词：

D O I：

10.1016/S0166-218X(97)00047-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

There is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces.

引用

页码：257 / 263

页数：7

共 8 条

[1] Grinberg E. J., 1968, LATVIAN MATH YB, V4, P51
[2] Grunbaum B., 1973, Journal of Combinatorial Theory, Series A, V14, P364, DOI 10.1016/0097-3165(73)90012-5
[3] Grunbaum B., 1976, AEQUATIONES MATH, V14, P191, DOI DOI 10.1007/BF01836218
[4] JENDROL S, IN PRESS LONGEST CYC
[5] CYCLICALLY 5-EDGE-CONNECTED CUBIC PLANAR GRAPHS AND SHORTNESS COEFFICIENTS
OWENS, PJ
[J]. JOURNAL OF GRAPH THEORY, 1982, 6 (04) : 473 - 479
[6] Tutte W. T., 1946, J. London Math. Soc, V21, P98, DOI 10.1112/jlms/s1-21.2.98
[7] PROBLEM OF EXISTENCE OF HAMILTONIAN CIRCUITS IN REGULAR PLANAR GRAPHS
WALTHER, H
[J]. MATHEMATISCHE NACHRICHTEN, 1969, 39 (4-6) : 277 - &
[8] Zaks J., 1982, AEQUATIONES MATH, V25, P97