2 papers
cs.DM2026
The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity
Jiangdong Ai, Gregory Gutin, Hui Lei +1
A trail is antidirected if its arcs alternate between forward and backward. A digraph is antistrong if, for every ordered pair of distinct vertices , it contains a…
math.CO2026
Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs
Hui Lei, Danning Wang, Yiqiao Wang
For an oriented graph , let be the maximum order of an induced acyclic subdigraph, its dichromatic number, and the minimum number of ar…