Circumferences and minimum degrees in 3-connected claw-free graphs |
| |
| Authors: | MingChu Li Yuan Tian Xu Yuan |
| |
| Institution: | a School of Software, Dalian University of Technology, Dalian 116620, China
b Department of Mathematics, Beijing Institute of Technology, Beijing 100081, China |
| |
| Abstract: | In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n,6δ−15}, thereby generalizing several known results. |
| |
| Keywords: | Claw-free graph Circumference 3-connectedness Minimum degree |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
