Gexin Yu

activity

20122021

most citedStrong edge-colorings for k-degenerate graphs

7 citations · 11 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

22 papers · 1 filter

math.CO2021

Sufficient conditions for 2-dimensional global rigidity

Xiaofeng Gu, Wei Meng, Martin Rolek +2

The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jordán, and Connelly,…

math.CO2021

Planar graphs without short even cycles are near-bipartite

Runrun Liu, Gexin Yu

A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are $3$ -colorab…

math.CO2020

Enhancing the Erdős-Lovász Tihany Conjecture for graphs with independence number two

Yue Wang, Gexin Yu

Let $s \geq 2$ and $t \geq 2$ be integers. A graph $G$ is $(s, t)$ -\emph{splittable} if $V (G)$ can be partitioned into two sets $S$ and $T$ such that $χ (G [S]) \geq s$ and $χ (G [T]) \geq t$ .…

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

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 $…