Distance-restricted matching extendability of fullerene graphs |
| |
| Authors: | Michitaka Furuya Masanori Takatou Shoichi Tsuchiya |
| |
| Affiliation: | 1.College of Liberal Arts and Sciences,Kitasato University,Sagamihara,Japan;2.Department of Civil and Environmental Engineering,Hiroshima Institute of Technology,Hiroshima,Japan;3.School of Network and Information,Senshu University,Kawasaki-shi,Japan |
| |
| Abstract: | A fullerene graph is a 3-connected cubic plane graph whose all faces are bounded by 5- or 6-cycles. In this paper, we show that a matching M of a fullerene graph can be extended to a perfect matching if the following hold: (i) three faces around each vertex in ({x,y:xyin M}) are bounded by 6-cycles and (ii) the edges in M lie at distance at least 13 pairwise. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
