3 papers
math.CO2026
Reconfiguration graphs of -minor-free graphs
Ruijuan Gu, Hui Lei, Zhaoxiang Li +2
The -reconfiguration graph of a graph , denoted by , is the graph whose vertices are the proper -colorings of , with an edge between two co…
math.CO2024
Arc-disjoint in- and out-branchings in semicomplete split digraphs
Jiangdong Ai, Yiming Hao, Zhaoxiang Li +1
An \emph{out-tree (in-tree)} is an oriented tree where every vertex except one, called the \emph{root}, has in-degree (out-degree) one. An \emph{out-branching (in-branching…
math.CO2024
A complete characterization of split digraphs with a strong arc decomposition
Jiangdong Ai, Fankang He, Zhaoxiang Li +2
A \textbf{strong arc decomposition} of a (multi-)digraph is a partition of its arc set into two disjoint arc sets and such that both of the spanning subdi…