Yian Xu

collaborators

3 papers

math.CO2025

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…

math.CO2022

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 $ł \geq 2$ be a positive integer, let $G_{l}$ denote the family of graphs which have girth $2 ł + 1$ and have no holes of odd l…

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[…

The optimal binding function for (cap, even hole)-free graphs

On coloring of graphs of girth 2l + 1 without longer odd holes

On the chromatic number of some P5​-free graphs

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