论文信息 - Simple 3-polytopal graphs with edges of only two types and shortness coefficients

Simple 3-polytopal graphs with edges of only two types and shortness coefficients

Abstract We consider classes of simple 3-polytopal graphs whose edges are incident with either two 5-gons or a 5-gon and a q -gon ( q > 5). We show that the shortness coefficient is less than one for all q ⩾ 28, settle a question raised by Jendroľ and Tkac in a recent paper in the journal and prove that all the graphs in these classes are cyclically 4-edge-connected.

P. J. Owens | P.J Owens

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

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

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

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

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

[6] Peter J. Owens. Shortness parameters for planar graphs with faces of only one type , 1985, J. Graph Theory.

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

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

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

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

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