|
|||||
|
|
Long cycles in fullerene graphs |
|
| Authors: | Rok Erman Franti?ek Kardo? Jozef Mi?kuf |
| Institution: | (1) Department of Applied Mathematics (KAM) and Institute for Theoretical Computer Science (ITI), Faculty of Mathematics and Physics, Charles University, Malostranské Náměstí 25, 118 00 Prague, Czech Republic;(2) Department of Mathematics, University of Ljubljana, Jedranska 19, 1111 Ljubljana, Slovenia |
| Abstract: | It is conjectured that every fullerene graph is hamiltonian. Jendrol’ and Owens proved J. Math. Chem. 18 (1995), pp. 83–90] that every fullerene graph on n vertices has a cycle of length at least 4n/5. In this paper we, improve this bound to 5n/6 − 2/3. |
| Keywords: | Fullerene Fullerene graph Cubic planar graph Long cycle Hamilton cycle |
| 本文献已被 SpringerLink 等数据库收录！ | |