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 2024Show all

4 papers · 1 filter

math.CO2024

Packing edge-colorings of subcubic outerplanar graphs

Sijin Li, Yifan Li, Xujun Liu

For a sequence $S = (s_{1}, s_{2}, \dots, s_{k})$ of non-decreasing positive integers, an $S$ -packing edge-coloring (S-coloring) of a graph $G$ is a partition of $E (G)$ into $E_1, E_2,…

math.CO2024

Partition subcubic planar graphs into independent sets

Xujun Liu, Yan Wang

A packing $(1^{ℓ}, 2^{k})$ -coloring of a graph $G$ is a partition of $V (G)$ into $ℓ$ independent sets and $k$ $2$ -packings (whose pairwise vertex distance is at least $3$ ). The…

math.CO2024

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable

Xujun Liu, Xin Zhang, Yanting Zhang

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

math.CO2024★ 1 cited

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

Xujun Liu, Gexin Yu

An induced matching in a graph $G$ is a matching such that its end vertices also induce a matching. A $(1^{ℓ}, 2^{k})$ -packing edge-coloring of a graph $G$ is a partition of its e…

Packing edge-colorings of subcubic outerplanar graphs

Partition subcubic planar graphs into independent sets

Every subcubic graph is packing (1,1,2,2,3)-colorable

On the (12,24)-packing edge-coloring of subcubic graphs

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable

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