论文信息 - Non-Hamiltonian 3-Polytopes whose Faces are all Pentagons - 字舞流文

Non-Hamiltonian 3-Polytopes whose Faces are all Pentagons

For some classes of 3-connected planar graphs whose faces are all pentagons, and whose vertices have only two different valencies, it is shown that the shortness exponent or coefficient is less than one.

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

[2] P. J. Owens,et al. Shortness parameters of families of regular planar graphs with two or three types of face , 1982, Discret. Math..

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

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

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

[6] P. J. Owens. Cyclically 5-edge-connected cubic planar graphs and shortness coefficients , 1982, J. Graph Theory.