On the oriented diameter of near planar triangulations
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:2SFQYENCrecord.jsonopen to challenge →
classification
math.CO
keywords
diameterorientedboundnearplanartriangulationsupperconnected
read the original abstract
In this paper, we show that the oriented diameter of any $n$-vertex $2$-connected near triangulation is at most $\lceil{\frac{n}{2}}\rceil$ (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang et.al. on the oriented diameter of maximal outerplanar graphs, and improves an upper bound of $n/2+O(\sqrt{n})$ on the oriented diameter of planar triangulations by Mondal, Parthiban and Rajasingh.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.