Title of article
Convex Programming and Circumference of 3-Connected Graphs of Low Genus
Author/Authors
Gao، نويسنده , , Zhicheng and Yu، نويسنده , , Xingxing، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
13
From page
39
To page
51
Abstract
The circumference of a graphGis the length of a longest cycle inG. In this paper, we shall show that, ifGis a 3-connected graph embeddable in the plane, the projective plane, the torus, or the Klein bottle, thenGhas circumference at least (1/6)×|V(G)|0.4+1. This improves a result of Jackson and Wormald.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526201
Link To Document