Rong Chen

collaborators

2 papers

math.CO2026

On tree decompositions whose trees are subgraphs

Rong Chen, Enzi Liao

Fix $k \in N$ and let $G$ be a connected graph with treewidth at most $k$ . We say that $x y \in / E (G)$ is a {\em $k$ -ghost-edge} of $G$ if for every tree decomposition $(…

math.CO2025

Graphs with girth $2 ℓ$ and without longer even holes are $3$ -colorable

Rong Chen

For a number $ℓ \geq 2$ , let $H_{ℓ}$ denote the family of graphs which have girth $2 ℓ$ and have no even hole with length greater than $2 ℓ$ . Wu, Xu, and Xu conj…

On tree decompositions whose trees are subgraphs

Graphs with girth 2ℓ and without longer even holes are 3-colorable

Graphs with girth $2 ℓ$ and without longer even holes are $3$ -colorable