Xiangyang Wang

collaborators

3 papers

math.CO2026

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable

Xinmin Hou, Xujun Liu, Xiangyang Wang

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots, s_{k})$ of positive integers, a packing $S$ -coloring of a graph $G$ is a partition of $V (G)$ into $V_{1}, V_{2}, \dots, V_{k}$ such t…

math.CO2026

Monochromatic triangle-tilings in dense graphs without large independent sets

Xinmin Hou, Xiangyang Wang, Zhi Yin

Given two graphs $H$ and $G$ , an $H$ -tiling is a family of vertex-disjoint copies of $H$ in $G$ . A perfect $H$ -tiling covers all vertices of $G$ . The Corradi-Hajnal theorem (1963)…

math.CO2025

Divisible subdivisions of graphs in subdivisions of complete graphs

Xinmin Hou, Xiangyang Wang

Let $Z_{q}$ denote the cyclic group of order $q$ . A $Z_{q}$ -edge-weighted $K_{f}$ is the complete graph $K_{f}$ equipped with a weight function $Ï: E(K_f) \to \mathbb{Z}…

Every connected subcubic graph except the Petersen graph is packing (1,1,2,2)-colorable

Monochromatic triangle-tilings in dense graphs without large independent sets

Divisible subdivisions of graphs in subdivisions of complete graphs

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable