Longest cycles in 3-connected graphs |
| |
Authors: | B Wei |
| |
Institution: | Institute of Systems Science, Academia Sinica, Beijing 100080, China |
| |
Abstract: | In this paper, we get the following result: Let G be a 3-connected graph with n vertices. Then
, where . This is a new lower bound for the circumference c(G) of a 3-connected graph G. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|