论文信息 - Shortness parameters of families of regular planar graphs with two or three types of face

Shortness parameters of families of regular planar graphs with two or three types of face

This paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-connected cubic planar graphs whose faces are all pentagons or 10-gons contains non-Hamiltonian members and that the shortness coefficient of this class of graphs is less than unity. For several classes of 3-connected regular planar graphs, of valency 4 or 5, it is shown that the shortness exponent is less than unity.

P. J. Owens | P.J. Owens

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

[2] Peter J. Owens. On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks , 1980, J. Comb. Theory, Ser. B.

[3] D. H. Younger,et al. Non-hamiltonian cubic planar maps , 1974, Discret. Math..

[4] O. Ore. The Four-Color Problem , 1967 .

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

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

[7] Joseph Zaks,et al. Pairs of Hamiltonian circuits in 5-connected planar graphs , 1976, J. Comb. Theory, Ser. B.

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

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

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