5 papers · 1 filter
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…
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…
The optimal binding function for (cap, even hole)-free graphs
Ran Chen, Baogang Xu, Yian Xu
A {\em hole} is an induced cycle of length at least 4, an {\em even hole} is a hole of even length, and a {\em cap} is a graph obtained from a hole by adding an additional vertex w…
Perfect divisibility of (fork, antifork)-free graphs
Ran Chen, Baogang Xu, Miaoxia Zhuang
A {\em fork} is a graph obtained from (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket}…
Coloring of graphs without long odd holes
Ran Chen, Baogang Xu
A {\em hole} is an induced cycle of length at least 4, a -hole is a hole of length , and an {\em odd hole} is a hole of odd length. Let be an integer. Let ${\cal…