Xujun Liu

activity

20172026

most citedPacking chromatic number of subcubic graphs

2 citations · 8 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

On $(1, 2^{4})$ and $(1, 2^{5})$ -packing edge-coloring of sparse subcubic graphs

Seog-Jin Kim, Xujun Liu, Boyan Xu

A $(1^{j}, 2^{k})$ -packing edge-coloring of a graph $G$ is a partition of the edge set $E (G)$ into $j$ matchings and $k$ induced matchings. Hocquard, Lajou, and Lu\v zar found a subcubi…

math.CO2026

Between proper and square colorings of planar graphs with maximum degree at most four

Xujun Liu, Zihui Xu, Xin Zhang

An $i$ -independent set is a vertex set whose pairwise distance is at least $i + 1$ . A proper (square) $k$ -coloring of a graph $G$ is a partition of its vertex set into $k$ independen…

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

On $(1^{2}, 2^{2})$ -packing edge-coloring of sparse subcubic graphs

Xujun Liu, Jiacheng Yang, Xin Zhang

For positive integers $ℓ$ and $k$ , a $(1^{ℓ}, 2^{k})$ -packing edge-coloring of a graph $G$ is a partition of $E (G)$ into $ℓ$ matchings and $k$ induced matchings. A graph is $d…

On (1,24) and (1,25)-packing edge-coloring of sparse subcubic graphs

Between proper and square colorings of planar graphs with maximum degree at most four

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

On (12,22)-packing edge-coloring of sparse subcubic graphs

On $(1, 2^{4})$ and $(1, 2^{5})$ -packing edge-coloring of sparse subcubic graphs

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

On $(1^{2}, 2^{2})$ -packing edge-coloring of sparse subcubic graphs