Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903205 | Discrete Mathematics | 2017 | 12 Pages |
Abstract
Let Ï4â=min{âi=14d(vi)+|âi=14N(vi)|â|âi=14N(vi)|:{v1,v2,v3,v4} is an independent set of a graph G}. In this paper, we give a low bound for the length of a longest cycle in a 4-connected graph and get the following result: If G is a 4-connected graph on n vertices, then the circumference c(G)â¥min{n,Ï4ââ2}. Moreover, we give graphs to show that the connectivity in our result is best possible with respect to the low bound and the low bound in our result is also best possible with respect to the connectivity.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Junqing Cai, Hao Li, Qiang Sun,