论文信息 - Longest cycles in generalized Buckminsterfullerene graphs - 字舞流文

Longest cycles in generalized Buckminsterfullerene graphs

It is shown that every regular 3-valent polyhedral graph whose faces are all 5-gons and 6-gons contains a cycle through at least 4/5 of its vertices.

Stanislav Jendrol' | Peter J. Owens

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

[2] Peter E. John,et al. An algorithmic approach to the number of spanning trees in Buckminsterfullerene , 1994 .

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

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

[5] Walter Thiel,et al. MNDO Study of Large Carbon Clusters , 1991 .

[6] Michal Tkác. On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles , 1994, Discret. Math..

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

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

[9] S. C. O'brien,et al. C60: Buckminsterfullerene , 1985, Nature.

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

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