English

Planar cubic graphs of small diameter

Combinatorics 2019-08-26 v2

Abstract

Cubic planar nn-vertex graphs with faces of length at most 66, e.g., fullerene graphs, have diameter in Ω(n)\Omega(\sqrt{n}). It has been suspected, that a similar result can be shown for cubic planar graphs with faces of bounded length. This note provides a family of cubic planar nn-vertex graphs with faces of length at most 77 and diameter in O(logn){O}(\log n), thus refuting the above suspicion.

Keywords

Cite

@article{arxiv.1908.05481,
  title  = {Planar cubic graphs of small diameter},
  author = {Kolja Knauer and Piotr Micek},
  journal= {arXiv preprint arXiv:1908.05481},
  year   = {2019}
}

Comments

2 pages, 2 figures

R2 v1 2026-06-23T10:48:07.774Z