Xujun Liu

most citedMonochromatic connected matchings in 2-edge-colored multipartite graphs

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

collaborators

3 papers

math.CO2019

Monochromatic paths and cycles in $2$ -edge-colored graphs with large minimum degree

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

A graph $G$ arrows a graph $H$ if in every $2$ -edge-coloring of $G$ there exists a monochromatic copy of $H$ . Schelp had the idea that if the complete graph $K_{n}$ arrows a small gr…

math.CO2019★ 4 cited

Monochromatic connected matchings in 2-edge-colored multipartite graphs

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

A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$ . Following Łuczak,there have been many results using the existence of large conn…

math.CO2018★ 1 cited

Packing chromatic number of subdivisions of cubic 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…

Monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree

Monochromatic connected matchings in 2-edge-colored multipartite graphs

Packing chromatic number of subdivisions of cubic graphs

Monochromatic paths and cycles in $2$ -edge-colored graphs with large minimum degree