Di Wu

activity

20242026

collaborators

4 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…

math.CO2025

Structure, Coloring, and Perfect Divisibility of $(P_{2} \cup P_{4}, C_{3})$ -Free Graphs

Di Wu, Xiaowen Zhang

Goedgebeur and Schaudt [J. Graph Theory 87 (2018), 188-207] conjectured that every $4$ -vertex-critical $(P_{7}, C_{3})$ -free graph belongs to a family of seven explicitly defined graphs…

math.CO2024

Coloring some $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors

Ran Chen, Di Wu, Xiaowen Zhang

The Borodin-Kostochka Conjecture states that for a graph $G$ , if $Δ (G) \geq 9$ , then $χ (G) \leq max {Δ (G) - 1, ω (G)}$ . We use $P_{t}$ and $C_{t}$ to denote a path and a cycle on $t$ vertice…

Perfect divisibility and perfect-Pollyanna in bull-free graphs

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

Structure, Coloring, and Perfect Divisibility of (P2​∪P4​,C3​)-Free Graphs

Coloring some (P6​,C4​)-free graphs with Δ−1 colors

Structure, Coloring, and Perfect Divisibility of $(P_{2} \cup P_{4}, C_{3})$ -Free Graphs

Coloring some $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors