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 2022Show all

2 papers · 1 filter

math.CO2022

Spanning tree packing and 2-essential edge-connectivity

Xiaofeng Gu, Runrun Liu, Gexin Yu

An edge (vertex) cut $X$ of $G$ is $r$ -essential if $G - X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$ -essentially $k$ -edge-connected (resp. $k$ -conn…

math.CO2022

1-planar graphs are odd 13-colorable

Runrun Liu, Weifan Wang, Gexin Yu

An odd coloring of a graph $G$ is a proper coloring such that any non-isolated vertex in $G$ has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by…