@article {IOPORT.06026861,
    author       = {Nicholson, Ruanui and Sneddon, Jamie},
    title        = {New graphs with thinly spread positive combinatorial curvature.},
    year         = {2011},
    journal      = {New Zealand Journal of Mathematics [electronic only]},
    volume       = {41},
    issn         = {1171-6096},
    pages        = {39-43, electronic only},
    publisher    = {New Zealand Mathematical Society, Auckland; Department of Mathematics, The University of Auckland, Auckland},
    abstract     = {Summary: The combinatorial curvature at a vertex $v$ of a plane graph $G$ is defined as $K_G(v) = 1 - v/2 + \sum_{f \sim v} 1/|f|$. As a consequence of Euler's formula, the total curvature of a plane graph is 2. In 2008, {\it L. Zhang} [Discrete Math. 308, No.\,24, 6588--6595 (2008; Zbl 1161.05031)] showed that $|V(G)| < 580$ for plane graphs with everywhere positive combinatorial curvature other than prisms and antiprisms. We improve on the largest known such graph (on 138 vertices) found by {\it T. R\'eti, E. Bitay}, and {\it Zs. Kosztol\'anyi} [``On the polyhedral graphs with positive combinatorial curvature", Acta Polytechnica Hungarica 2, No.\,2, 19--37 (2005)] by giving a graph on 208 vertices having positive combinatorial curvature at every vertex with $K_G(v) \in \lbrace 1/13,1/66,1/132,1/858\rbrace$ for all $v \in V(G)$. We also give a non-orientable PCC graph with 104 vertices.},
    identifier   = {06026861},
}