Cycles through 4 vertices in 3-connected graphs |
| |
| Authors: | Xuezheng Lv Chengdong Yi |
| |
| Affiliation: | a Department of Mathematics, Renmin University of China, Beijing 100872, China
b School of Management Science and Engineering, Central University of Finance and Economics, Beijing, 100081, China |
| |
| Abstract: | S.C. Locke proposed a question: If G is a 3-connected graph with minimum degree d and X is a set of 4 vertices on a cycle in G, must G have a cycle through X with length at least min{2d,|V(G)|}? In this paper, we answer this question. |
| |
| Keywords: | Cycles 3-Connected graphs Prescribed vertex set |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
