Diego Nicodemos, Matěj Stehlík
Published 2016-04-07Version 1
A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of Andova and \v{S}krekovski [MATCH Commun. Math. Comput. Chem. 70 (2013) 205-220], who conjectured that every fullerene graph on $n$ vertices has diameter at least $\lfloor \sqrt{5n/3}\rfloor-1$.
Odd cycle transversals and independent sets in fullerene graphs
2-Resonant fullerenes
On bipartite distance-regular Cayley graphs with small diameter
![QR code for arXiv:1604.01934 [math.CO]](http://oss.arxitics.com/images/favicon.svg)