On the oriented diameter of near planar triangulations

Document Type

Article

Publication Date

5-1-2025

Abstract

In this paper, we show that the oriented diameter of any n-vertex 2-connected near triangulation is at most [Formula presented] (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang et al. (2021) [29] on the oriented diameter of maximal outerplanar graphs, and improves an upper bound of n/2+O(n) on the oriented diameter of planar triangulations by Mondal et al. (2024) [24].

Publication Source (Journal or Book title)

Discrete Mathematics

This document is currently not available here.

Share

COinS