论文信息 - Hamiltonicity in multitriangular graphs - 字舞流文

Hamiltonicity in multitriangular graphs

The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown to contain non-hamiltonian graphs and to have a shortness exponent smaller than one.

P. J. Owens | Hansjoachim Walther | Peter J. Owens | H. Walther

[1] Joseph Zaks. Non-Hamiltonian non-Grinbergian graphs , 1977, Discret. Math..

[2] Joseph Zaks,et al. Non-Hamiltonian Simple Planar Graphs , 1982 .

[3] Brendan D. McKay,et al. The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices , 1988, J. Comb. Theory, Ser. B.

[4] P. J. Owens. Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons , 1981, Discret. Math..

[5] Hansjoachim Walther,et al. Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen† , 1969 .

[6] P. J. Owens,et al. Simple 3-polytopal graphs with edges of only two types and shortness coefficients , 1986, Discret. Math..

[7] Michal Tkáč. Shortness coefficients of simple 3-polytopal graphs with edges of only two types , 1992, Discret. Math..

[8] W. T. Tutte. On Hamiltonian Circuits , 1946 .

[9] Joseph Zaks. Non-Hamiltonian simple 3-polytopes having just two types of faces , 1980, Discret. Math..

[10] Hansjoachim Walther. Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes , 1981, Discret. Math..

[11] Hansjoachim Walther,et al. Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

[12] Peter J. Owens. Regular planar graphs with faces of only two types and shortness parameters , 1984, J. Graph Theory.