Rong Wu

collaborators

3 papers

math.CO2026

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

Yan Wang, Rong Wu

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

math.CO2026

The perfect divisibility and chromatic number of some odd hole-free graphs

Weihua He, Yueping Shi, Rong Wu +1

A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph $G$ is perfectly di…

math.CO2025

Optimal $I ¨ $ -boundness of $ℓ$ -holed graphs

Yan Wang, Rong Wu

A graph is {\em{ $ℓ$ -holed}} if all of its induced cycles of length at least four have length exactly $ℓ$ . In the paper, we prove that if $G$ is an $ℓ$ -holed graph with odd…

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

The perfect divisibility and chromatic number of some odd hole-free graphs

Optimal I¨-boundness of ℓ-holed graphs

Optimal $I ¨ $ -boundness of $ℓ$ -holed graphs