Yongtang Shi

collaborators

4 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 $D$ is antistrong if, for every ordered pair of distinct vertices $x, y \in V (D)$ , it contains a…

math.CO2024

The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs

Hui Lei, Mei Lu, Yongtang Shi +2

Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related res…

math.CO2024

Reconfiguration graphs for vertex colorings of $P_{5}$ -free graphs

Hui Lei, Yulai Ma, Zhengke Miao +2

For any positive integer $k$ , the reconfiguration graph for all $k$ -colorings of a graph $G$ , denoted by $R_{k} (G)$ , is the graph where vertices represent the $k$ -colorings…

math.CO2024

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

Jiangdong Ai, Hui Lei, Bo Ning +1

Let $G$ be a connected graph and $P (G)$ a graph parameter. We say that $P (G)$ is feasible if $P (G)$ satisfies the following properties: (I) $\mathcal{…

The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity

The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs

Reconfiguration graphs for vertex colorings of P5​-free graphs

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

Reconfiguration graphs for vertex colorings of $P_{5}$ -free graphs