7 papers
Perfect divisibility and perfect-Pollyanna in bull-free graphs
Ran Chen, Paras Vinubhai Maniya, Di Wu +1
A graph is {\em perfectly divisible} if, for each induced subgraph of , can be partitioned into and such that is perfect and . A {\…
Perfect Divisibility and Coloring of Some Bull-Free Graphs
Ran Chen, Di Wu, Junran Yu +1
A graph is {\em perfectly divisible} if, for each induced subgraph of , can be partitioned into and such that is perfect and . A {\…
Structure, Perfect Divisibility and Coloring of ()-Free Graphs
Ran Chen, Di Wu, Xiaowen Zhang
Goedgebeur and Schaudt [J. Graph Theory 87 (2018) 188-207] conjectured that all 4-vertex-critical -free graphs belongs to the family , which consists of seven ex…
Structure and linear-Pollyanna for some square-free graphs
Ran Chen, Baogang Xu
We use and to denote a path and a cycle on vertices, respectively. A {\em bull} is a graph consisting of a triangle with two disjoint pendant edges, a {\em hammer}…
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}…