Chaoliang Tang

activity

20212026

collaborators

Showing 2026Show all

5 papers · 1 filter

cs.DS2026

The directed temporal exploration problem

Marcelo Garlet Milani, Lucas Picasarri-Arrieta, Chaoliang Tang +1

We study the temporal exploration problem on temporal digraphs. We prove that a lifetime of $O (n^{2})$ suffices to guarantee the existence of a temporal exploration on always-unilate…

math.CO2026

Bounded Twin-Width Tournaments are $\dchi$-Bounded

Chaoliang Tang, Junchi Zhang

For a tournament $T$ and a vertex ordering $≺$ , let $T^{≺}$ be the graph of backward arcs in $≺$ . The diclique number of a tournament is $\domega(T)=\min_{\prec}ω(T^{\p…

math.CO2026

Quasi-kernels in Hereditary Classes and Applications to Break

Jiangdong Ai, Tianyu Huang, Xiangzhou Liu +2

Recently, Nguyen, Seymour and Scott verified the small quasi-kernel conjecture for split digraphs, and initiated the study of quasi-kernels in break digraphs. Following their resea…

cs.DS2026

Hardness and Approximation for Coloring Digraphs

Parinya Chalermsook, Harmender Gahlawat, Felix Klingelhoefer +2

The dichromatic number $χ (D)$ of a digraph is the minimum number $k$ such that $V (D)$ can be partitioned into $k$ subsets, each inducing an acyclic digraph. The acyclic number…

math.CO2026

The linear Turán number of the 3-graph $P_{5}$

Chaoliang Tang, Hehui Wu, Junchi Zhang

We prove that for any linear 3-graph on $n$ vertices without a path of length 5, the number of edges is at most $\frac{15}{11} n$ , and the equality holds if and only if the graph is…

The directed temporal exploration problem

Bounded Twin-Width Tournaments are $\dchi$-Bounded

Quasi-kernels in Hereditary Classes and Applications to Break

Hardness and Approximation for Coloring Digraphs

The linear Turán number of the 3-graph P5​

The linear Turán number of the 3-graph $P_{5}$