3 papers
math.CO2026
The perfect divisibility and chromatic number of some odd hole-free graphs
Weihua He, Yueping Shi, Rong Wu +1
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph is perfectly di…
math.CO2025
The List Linear Arboricity of Digraphs
Yueping Shi, Ping Hu
A (directed) linear forest is a (di)graph whose components are (directed) paths. The linear arboricity of a (di)graph is the minimum number of (directed) linear forests…
math.CO2025
List rainbow connection number of graphs
Rongxia Tang, Henry Liu, Yueping Shi +1
An edge-coloured path is rainbow if all of its edges have distinct colours. Let be a connected graph. The rainbow connection number of , denoted by , is the minimum n…