Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges

The paper deals with the longest circuits in triangular and quadrangular 3-polytopes with two types of edges. Hamiltonicity and shortness invariants for several families of the mentioned 3-polytopes are determined. Three relationships among some subfamilies of triangular and quadrangular 3-polytopes are given.

[1]  Günter Ewald,et al.  Neuere Entwicklungen in der kombinatorischen Konvexgeometrie , 1979 .

[2]  Stanislav Jendrol',et al.  On the simplicial 3-polytopes with only two types of edges , 1984, Discret. Math..

[3]  Günter Ewald.  Hamiltonian circuits in simplicial complexes , 1973 .

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

[5]  Jochen Harant,et al.  Some new results about the shortness exponent in polyhedral graphs , 1987 .

[6]  Stanislav Jendro,et al.  On the simplicial 3-polytopes with only two types of edges , 1984 .

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

[8]  Branko Grünbaum,et al.  Pairs of edge-disjoint Hamiltonian circuits , 1976 .

[9]  Stanislav Jendrol',et al.  On quadrangular convex 3-polytopes with at most two types of edges , 1989, Discret. Math..

[10]  B. Grünbaum.  Polytopes, graphs, and complexes , 1970 .

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

[12]  Bill Jackson,et al.  Longest cycles in 3-connected cubic graphs , 1986, J. Comb. Theory, Ser. B.

[13]  Stanislav Jendrol,et al.  Vertex-vectors of quadrangular 3-polytopes with two types of edges , 1989 .

[14]  P. J. Owens.  Non-Hamiltonian Simple 3-Polytopes with Only One Type of Face Besides Triangles , 1984 .

[15]  Günter Ewald.  On shortness exponents of families of graphs , 1973 .

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