Wei-Quan Dong

collaborators

2 papers

math.CO2022

A tight linear bound to the chromatic number of $(P_{5}, K_{1} + (K_{1} \cup K_{3}))$ -free graphs

Wei Dong, Baogang Xu, Yian Xu

Let $F_{1}$ and $F_{2}$ be two disjoint graphs. The union $F_{1} \cup F_{2}$ is a graph with vertex set $V (F_{1}) \cup V (F_{2})$ and edge set $E (F_{1}) \cup E (F_{2})$ , and the join $F_{1} + F_{2}$ is a gra…

math.CO2022

On the chromatic number of some $P_{5}$ -free graphs

Wei Dong, Baogang Xu, Yian Xu

Let $G$ be a graph. We say that $G$ is 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[…

A tight linear bound to the chromatic number of (P5​,K1​+(K1​∪K3​))-free graphs

On the chromatic number of some P5​-free graphs

A tight linear bound to the chromatic number of $(P_{5}, K_{1} + (K_{1} \cup K_{3}))$ -free graphs

On the chromatic number of some $P_{5}$ -free graphs