The Complexity of the Proper Orientation Number

TL;DR

This paper investigates the computational complexity of determining the proper orientation number of graphs, proving NP-hardness for certain classes and providing polynomial algorithms for others, thus advancing understanding of graph orientation problems.

Contribution

It establishes NP-completeness for deciding the proper orientation number of planar graphs and NP-hardness for 4-regular graphs, while providing a polynomial-time algorithm for 3-regular graphs.

Findings

NP-complete to decide if the proper orientation number equals 2 for planar graphs

Polynomial-time algorithm for 3-regular graphs

NP-hard for 4-regular graphs

Abstract

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V,E)$ is an orientation $D$ of $E(G)$ such that for every two adjacent vertices $ v $ and $ u $, $ d^{-}_{D}(v) \neq d^{-}_{D}(u)$ where $d_{D}^{-}(v)$ is the number of edges with head $v$ in $D$. The proper orientation number of $G$ is defined as $ \overrightarrow{\chi} (G) =\displaystyle \min_{D\in \Gamma} \displaystyle\max_{v\in V(G)} d^{-}_{D}(v) $ where $\Gamma$ is the set of proper orientations of $G$. We have $ \chi(G)-1 \leq \overrightarrow{\chi} (G)\leq \Delta(G) $. We show that, it is $ \mathbf{NP} $-complete to decide whether $\overrightarrow{\chi}(G)=2$, for a given planar graph $G$. Also, we prove that there is a polynomial time algorithm for determining the proper orientation number of 3-regular graphs. In sharp contrast, we will prove that this problem is $ \mathbf{NP} $-hard for 4-regular graphs.