On the proper orientation number of bipartite graphs
type: Dataset
description: An {\it orientation} of a graph~$G$ is a digraph~$D$ obtained from~$G$ by replacing each edge by exactly one of the two possible arcs with the same endvertices. For each~$v \in V(G)$, the \emph{indegree} of~$v$ in~$D$, denoted by~$d^-_D(v)$, is the number of arcs with head~$v$ in~$D$. An orientation~$D$ of~$G$ is \emph{proper} if~$d^-_D(u)\neq d^-_D(v)$, for all~$uv\in E(G)$. The \emph{proper orientation number} of a graph~$G$, denoted by~$\po(G)$, is the minimum of the maximum indegree over all its proper orientations. In this paper, we prove that~$\po(G) \leq \left\lfloor \left(\Delta(G) + \sqrt{\Delta(G)}\right)/2 \right\rfloor+ 1$ if~$G$ is a bipartite graph, and~$\po(G)\leq 4$ if~$G$ is a tree. % Moreover, we show that deciding whether the proper orientation number is at most~2 and at most~3 % is an $\NP$-complete problem for planar subcubic graphs and planar bipartite graphs, respectively. It is well-known that~$\po(G)\leq \Delta(G)$, for every graph~$G$. However, we prove that deciding whether~$\po(G)\leq \Delta(G)-1$ is already an~$\NP$-complete problem. We also show that it is~$\NP$-complete to decide whether~$\po(G)\leq 2$, for planar \emph{subcubic} graphs~$G$. Moreover, we prove that it is~$\NP$-complete to decide whether $\po(G)\leq 3$, for planar bipartite graphs~$G$ with maximum degree~5.
landing page: https://inria.hal.science/hal-00957453
identifier: Report N°: RR-8492
keyword: bipartite-graph
keyword: graph-colouring
keyword: infoeu-reposemanticsreport
keyword: infoinfo-cccomputer-science-cscomputational-complexity-cscc
keyword: mathmath-comathematics-mathcombinatorics-mathco
keyword: proper-orientation
keyword: reports
issued: 2026-05-06T02:25:09.964682
modified: 2026-05-06T02:25:09.964686
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

On the proper orientation number of bipartite graphs
type: Distribution
format: HTML
access URL: https://inria.hal.science/hal-00957453
issued: 2026-05-06T02:25:09.978148
modified: 2026-05-06T02:25:09.954867