Junran Yu

collaborators

2 papers

math.CO2026

Perfect divisibility and perfect-Pollyanna in bull-free graphs

Ran Chen, Paras Vinubhai Maniya, Di Wu +1

A graph $G$ is {\em perfectly divisible} if, for each induced subgraph $H$ of $G$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $ω (H [B]) < ω (H)$ . A {\em…

math.CO2025

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

Ran Chen, Di Wu, Junran Yu +1

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $ω (H [B]) < ω (H)$ . Chudn…