Title of article
Graphs with a Cycle of Length Divisible by Three
Author/Authors
Chen، نويسنده , , G.T. and Saito، نويسنده , , A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
16
From page
277
To page
292
Abstract
In this paper, we will prove that every graph G with minimum degree δ(G) ≥ 3 contains a cycle of length divisible by three. This was conjectured to be true by Barefoot, Clark, Douthett, and Entringer.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525852
Link To Document