# zbMATH — the first resource for mathematics

Simple 3-polytopal graphs with edges of only two types and shortness coefficients. (English) Zbl 0768.05065
Summary: It is shown that the class of simple 3-polytopal graphs whose edges are incident with either two 7-gons or a 7-gon and a 4-gon, contains non- Hamiltonian members and even has shortness coefficient less then unity.

##### MSC:
 05C38 Paths and cycles 52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) 52B10 Three-dimensional polytopes
##### Keywords:
cycles; 3-polytopal graphs; shortness coefficient
Full Text:
##### References:
 [1] GAPOBIANCO M., MULLUZZO J. C.: Examples and Counterexamples in Graph Theory. North-Holland, New York, 1978. [2] GOODEY P. R.: Hamiltoman circuits in polytopes with evensided faces. Israel J. Math. 22 (1975), 52-56. · Zbl 0317.05114 [3] GOODEY P. R.: A class of Hamiltonian polytopes. J. Graph Theory 1 (1977), 181-185. · Zbl 0379.05037 [4] JENDROĽ S., MIHÓK P.: Note on a class of Hamiltonian polytopes. Discrete Math. 71 (1988), 233-241. · Zbl 0655.05045 [5] JENDROĽ S., TKÁČ M.: On the simplicial 3-polytopes with only two types of edges. Discrete Math. 48 (1984), 229-241. · Zbl 0536.52003 [6] JUCOVIČ E.: Convex 3-polytopes. (Slovak), Veda, Bratislava, 1981. [7] OWENS P. J.: Simple 3-polytopal graphs with edges of only two types and shortness coefficients. Discrete Math. 59 (1986), 107-114. · Zbl 0586.05027 [8] OWENS P. J.: Non-Hamiltonian simple 3-polytopes with only one type of face besides triangles. Ann. Discrete Math. 20 (1984), 241-251. · Zbl 0571.05033 [9] TKÁČ M.: Note on shortness coefficients of simple 3-polytopal graphs with edges of only two types. Discrete Math. · Zbl 0776.05093 [10] TKÁČ M.: Note on shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles. · Zbl 0798.05018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.