Title of article
Cycles through 4 vertices in 3-connected graphs
Author/Authors
Lv، نويسنده , , Xuezheng and Yi، نويسنده , , Chengdong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
13
From page
64
To page
76
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 { 2 d , | V ( G ) | } ? In this paper, we answer this question.
Keywords
3-connected graphs , Prescribed vertex set , Cycles
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598464
Link To Document