Miaoxia Zhuang

collaborators

4 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 $ω (H [B]) < ω (H)$ , and a graph $G$ …

math.CO2025

Perfect divisibility of (fork, antifork $\cup K_{1}$ )-free graphs

Ran Chen, Baogang Xu, Miaoxia Zhuang

A {\em fork} is a graph obtained from $K_{1, 3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket}…

math.CO2025

On minimal nonperfectly divisible fork-free graphs

Baogang Xu, Miaoxia Zhuang

A fork is a graph obtained from $K_{1, 3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$ , $V (H)$ can be p…

math.CO2025

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 $ω (H [B]) < ω (H)$ . A graph $G$ is…

Some properties of minimally nonperfectly divisible graphs

Perfect divisibility of (fork, antifork∪K1​)-free graphs

On minimal nonperfectly divisible fork-free graphs

Perfect weighted divisibility is equivalent to perfect divisibility

Perfect divisibility of (fork, antifork $\cup K_{1}$ )-free graphs