Xujun Liu

most citedPacking chromatic number of subcubic graphs

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

collaborators

4 papers

math.CO2019★ 1 cited

Packing $(1, 1, 2, 2)$ -coloring of some subcubic graphs

Runrun Liu, Xujun Liu, Martin Rolek +1

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

math.CO2019★ 1 cited

Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

József Balogh, Alexandr Kostochka, Mikhail Lavrov +1

We solve four similar problems: For every fixed $s$ and large $n$ , we describe all values of $n_{1}, \dots, n_{s}$ such that for every $2$ -edge-coloring of the complete $s$ -partite grap…

math.CO2019

Ramsey numbers of ordered graphs under graph operations

Jesse Geneson, Amber Holmes, Xujun Liu +3

An ordered graph $G$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $G$ is the smallest integer $N$ such that…

math.CO2017★ 2 cited

Packing chromatic number of subcubic graphs

József Balogh, Alexandr Kostochka, Xujun Liu

A packing $k$ -coloring of a graph $G$ is a partition of $V (G)$ into sets $V_{1}, \dots, V_{k}$ such that for each $1 \leq i \leq k$ the distance between any two distinct $x, y \in V_{i}$ is a…

Packing (1,1,2,2)-coloring of some subcubic graphs

Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

Ramsey numbers of ordered graphs under graph operations

Packing chromatic number of subcubic graphs

Packing $(1, 1, 2, 2)$ -coloring of some subcubic graphs