Name
Abstract | ||
|---|---|---|
The circumference of a graph G is the length of a longest cycle in G . In this paper, we shall show that, if G is a 3-connected graph embeddable in the plane, the projective plane, the torus, or the Klein bottle, then G has circumference at least (1/6)×| V ( G )| 0.4 +1. This improves a result of Jackson and Wormald. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1006/jctb.1996.1719 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
low genus,3-connected graph,convex programming,klein bottle,projective plane,connected graph | Real projective plane,Graph,Circumference,Combinatorics,Klein bottle,Torus,Projective plane,Convex optimization,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
69 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
10 | 1.03 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhicheng Gao | 1 | 300 | 35.97 |
| Xingxing Yu | 2 | 577 | 68.19 |