Showing 2025 · math.COShow all
2 papers · 2 filters
math.CO2025
On Perfect Divisibility of Bull-Free Graphs Without Long Paths
Ran Chen, Di Wu, Junran Yu +1
A graph is {\em perfectly divisible} if, for every induced subgraph of , can be partitioned into and such that is perfect and . Chudn…
math.CO2025
Structure, Coloring, and Perfect Divisibility of -Free Graphs
Di Wu, Xiaowen Zhang
Goedgebeur and Schaudt [J. Graph Theory 87 (2018), 188-207] conjectured that every -vertex-critical -free graph belongs to a family of seven explicitly defined graphs…