Gexin Yu

activity

20102023

most citedLinear colorings of subcubic graphs

15 citations · 77 across the 40 of their papers we have counts for

collaborators

Showing 2019Show all

5 papers · 1 filter

math.CO2019★ 1 cited

Connectivity for Kite-Linked Graphs

Chris Stephens, Dong Ye

For a given graph $H$ , a graph $G$ is $H$ -linked if, for every injection $φ : V (H) \to V (G)$ , the graph $G$ contains a subdivision of $H$ with $φ (v)$ corresponding to $v$ , for each…

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★ 2 cited

Planar graphs with girth at least 5 are (3,4)-colorable

Ilkyoo Choi, Gexin Yu, Xia Zhang

A graph is $(d_{1}, \dots, d_{k})$ -colorable if its vertex set can be partitioned into $k$ nonempty subsets so that the subgraph induced by the $i$ th part has maximum degree at most $…

math.CO2019

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Seog-Jin Kim, Runrun Liu, Gexin Yu

DP-coloring (also known as correspondence coloring) is a generalization of list coloring, introduced by Dvořák and Postle in 2017. It is well-known that there are non-4-choosable p…

math.CO2019★ 2 cited

Fat-triangle linkage and kite-linked graphs

Runrun Liu, Martin Rolek, Gexin Yu

For a multigraph $H$ , a graph $G$ is $H$ -linked if every injective mapping $ϕ : V (H) \to V (G)$ can be extended to an $H$ -subdivision in $G$ . We study the minimum connectivity require…

Connectivity for Kite-Linked Graphs

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

Planar graphs with girth at least 5 are (3,4)-colorable

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Fat-triangle linkage and kite-linked graphs

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