4 citations · 6 across the 10 of their papers we have counts for
10 papers
Coloring_of_some_crown-free_graphs
Di Wu, Baogang Xu
Let and be two vertex disjoint graphs. The {\em union} is the graph with and . The {\em join} is the gra…
Structure and coloring of a family of ()-free graphs
Ran Chen, Baogang Xu
Let and be a path and a cycle on vertices, respectively. In 2021, Choudum {\em et al.} [Disc. Math. 344 (2021) 112244] determined the structures of ,…
Perfect divisibility and coloring of some fork-free graphs
Di Wu, Baogang Xu
A is an induced cycle of length at least four, and an odd hole is a hole of odd length. A {\em fork} is a graph obtained from by subdividing an edge once. An {\em…
The chromatic number of heptagraphs
Wu Di, Baogang Xu, Yian Xu
A hole is an induced cycle of length at least 4. A graph is called a pentagraph if it has no cycles of length 3 or 4 and has no holes of odd length at least 7, and is called a hept…
On coloring of graphs of girth 2l + 1 without longer odd holes
Di Wu, Baogang Xu, Yian Xu
A hole is an induced cycle of length at least 4. Let be a positive integer, let denote the family of graphs which have girth and have no holes of odd l…
On the chromatic number of some -free graphs
Wei Dong, Baogang Xu, Yian Xu
Let be a graph. We say that is perfectly divisible if for each induced subgraph of , can be partitioned into and such that is perfect and $ω(H[…