论文信息 - Cyclically 5-edge-connected cubic planar graphs and shortness coefficients - 字舞流文

Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

It is shown that some classes of cyclically 5-edge-connected cubic planar graphs with only one type of face besides pentagons contain non-Hamiltonian members and have shortness coefficients less than unity.

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

[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] Joseph Zaks. Shortness coefficient of cyclically 5-connected cubic planar graphs , 1982 .

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

[5] P. R. Goodey,et al. A class of Hamiltonian polytopes , 1977, J. Graph Theory.

[6] P. Goodey. Hamiltonian circuits in polytopes with even sided faces , 1975 .

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

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

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

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

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