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

Showing 2026Show all

2 papers · 1 filter

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…