Ran Chen

activity

20232026

collaborators

Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

Nearly optimal coloring of some C4-free graphs

Ran Chen, Baogang Xu

A class $G$ of graphs is $χ$ -{\em polydet} if $G$ has a polynomial binding function $f$ and there is a polynomial time algorithm to determine an $f (ω (G))$ -coloring of…

math.CO2024

Structure and linear-Pollyanna for some square-free graphs

Ran Chen, Baogang Xu

We use $P_{t}$ and $C_{t}$ to denote a path and a cycle on $t$ vertices, respectively. A {\em bull} is a graph consisting of a triangle with two disjoint pendant edges, a {\em hammer}…

math.CO2024

Coloring some $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors

Ran Chen, Di Wu, Xiaowen Zhang

The Borodin-Kostochka Conjecture states that for a graph $G$ , if $Δ (G) \geq 9$ , then $χ (G) \leq max {Δ (G) - 1, ω (G)}$ . We use $P_{t}$ and $C_{t}$ to denote a path and a cycle on $t$ vertice…

Nearly optimal coloring of some C4-free graphs

Structure and linear-Pollyanna for some square-free graphs

Coloring some (P6​,C4​)-free graphs with Δ−1 colors

Coloring some $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors