Rongchuan Tao

collaborators

2 papers

cs.DM2026

How Difficult Is It to Recognize CIS Graphs?

Rongchuan Tao, Mengxi Yang, Wenan Zang

A graph $G$ is called $C I S$ if each maximal clique intersects each maximal stable set of $G$ , with maximality taken with respect to set inclusion. CIS graphs resemble perfect graph…

math.CO2024

Integral Biflow Maximization

Guoli Ding, Rongchuan Tao, Mengxi Yang +1

Let $G = (V, E)$ be a graph with four distinguished vertices, two sources $s_{1}, s_{2}$ and two sinks $t_{1}, t_{2}$ , let $c : E \to Z_{+}$ be a capacity function, and let ${\c…