2 papers
cs.DM2026
How Difficult Is It to Recognize CIS Graphs?
Rongchuan Tao, Mengxi Yang, Wenan Zang
A graph is called if each maximal clique intersects each maximal stable set of , with maximality taken with respect to set inclusion. CIS graphs resemble perfect graph…
math.CO2026
Tournament Ranking: Duality and Efficiency
Ge Song, Mengxi Yang, Wenan Zang
The feedback arc set problem on tournaments arises in a rich variety of applications, and has been studied extensively in several research fields over the past six decades. It is w…