Rong Chen

collaborators

2 papers

math.CO2026

A counterexample to Hickingbotham's conjecture about $k$ -ghost-edges

Rong Chen

Fix $k \in N$ and let $G$ be a connected graph with $tw (G) \leq k$ . We say that $x y \in E (G^{c})$ is a {\em $k$ -ghost-edge} of $G$ if for every tree decomposition $(T,\cB)$ of…

math.CO2025

Characterization of $P_{3}$ -connected graphs

Rong Chen

For any pair of edges $e, f$ of a graph $G$ , we say that {\em $e, f$ are $P_{3}$ -connected in $G$ } if there exists a sequence of edges $e = e_{0}, e_{1}, \dots, e_{k} = f$ such that $e_{i}$ and $e_…

A counterexample to Hickingbotham's conjecture about k-ghost-edges

Characterization of P3​-connected graphs

A counterexample to Hickingbotham's conjecture about $k$ -ghost-edges

Characterization of $P_{3}$ -connected graphs