Gexin Yu

activity

20152026

(1^{2}, 2^{4})

-packing edge-coloring of subcubic graphs

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture

Ken-ichi Kawarabayashi, Gexin Yu

For a given subset $S \subseteq V (G)$ of a graph $G$ , the pair $(G, S)$ is \emph{knitted} if for every partition of $S$ into non-empty subsets $S_{1}, S_{2}, \dots, S_{t}$ , there exist pa…

math.CO2026

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles

Shu Fang, Runrun Liu, Gexin Yu

Graph coloring with preferences offers a powerful framework for constraint satisfaction problems in which fulfilling every request is impossible but satisfying a guaranteed positiv…

math.CO2025

Connectivity of contraction-critical graphs

Michael Lafferty, Runrun Liu, Martin Rolek +1

Contraction-critical graphs came from the study of minimal counterexamples to Hadwiger's conjecture. A graph is $k$ -contraction-critical if it is $k$ -chromatic, but any proper mino…

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…

math.CO2023

A new connectivity bound for a tournament to be highly linked

Bin Chen, Xinmin Hou, Gexin Yu +1

A digraph $D$ is $k$ -linked if for any pair of two disjoint sets ${x_{1}, x_{2}, \dots, x_{k}}$ and ${y_{1}, y_{2}, \dots, y_{k}}$ of vertices in $D$ , there exist vertex disjoint d…

math.CO2015

A relaxation of the strong Bordeaux Conjecture

Ziwen Huang, Xiangwen Li, Gexin Yu

Let $c_{1}, c_{2}, \dots, c_{k}$ be $k$ non-negative integers. A graph $G$ is $(c_{1}, c_{2}, \dots, c_{k})$ -colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, \ldots, V_…