Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two

TL;DR

This paper proves that in certain directed graphs with independence number two, there exist Hamiltonian cycles and paths with a limited number of backward arcs, extending previous degree-based results.

Contribution

It establishes bounds on backward arcs in Hamiltonian cycles and paths for 1- and 2-connected digraphs with independence number two, a novel structural insight.

Findings

2-connected digraphs with independence number 2 have Hamilton cycles with at most 5 backward arcs.

1-connected digraphs with independence number 2 have Hamilton paths with at most 2 backward arcs.

Extends degree-based Hamiltonicity results to independence number constraints.

Abstract

In a digraph $D=(V,A)$, an oriented path is a sequence $P=x_1x_2\dots x_p$ of distinct vertices such that either $x_ix_{i+1}\in A$ or $x_{i+1}x_{i}\in A$ or both for every $i\in [p-1]$. If $x_ix_{i+1}\in A$ in $P$, then $x_ix_{i+1}$ is a forward arc of $P$; otherwise, $x_{i+1}x_{i}$ is a backward arc. The independence number $\alpha(D)$ is the maximum integer $p$ such that $D$ has a set of $p$ vertices where there is no arc between any pair of vertices. A digraph is $k$-connected if its underlying undirected graph is $k$-connected. Freschi and Lo (JCT-B 2024) proved that every $n$-vertex oriented graph with minimum degree $\delta\ge n/2$ has a Hamilton oriented cycle with at most $n-\delta$ backward arcs. We prove that every 2-connected digraph $D$ with $\alpha(D)\le 2$ has a Hamilton oriented cycle with at most five backward arcs, and every 1-connected digraph $D$ with $\alpha(D)\le 2$ has a Hamilton oriented path with at most two backward arcs.