Baogang Xu

collaborators

2 papers

math.CO2026

Some properties of minimally nonperfectly divisible graphs

Qiming Hu, Baogang Xu, Miaoxia Zhuang

A graph is perfectly divisible if for each of its induced subgraph $H$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $I ¨ (H [B]) < I ¨ (H)$ , and a graph $…

math.CO2026

Perfect weighted divisibility is equivalent to perfect divisibility

Qiming Hu, Baogang Xu, Miaoxia Zhuang

A graph is perfectly divisible if for each of its induced subgraph $H$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $I ¨ (H [B]) < I ¨ (H)$ . A graph $G$ i…