Bao-Gang Xu

collaborators

2 papers

math.CO2023

Structure and coloring of some ( $P_{7}, C_{4}$ )-free graphs

Ran Chen, Di Wu, Baogang Xu

Let $G$ be a graph. We use $P_{t}$ and $C_{t}$ to denote a path and a cycle on $t$ vertices, respectively. A {\em diamond} is a graph obtained from two triangles that share exactly one…

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…

Structure and coloring of some (P7​,C4​)-free graphs

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

Structure and coloring of some ( $P_{7}, C_{4}$ )-free graphs

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