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

2 papers · 1 filter

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.CO2020★ 1 cited

Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs

Yue Wang, Gexin Yu

In this paper, we prove an enhanced version of the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. That is, for every graph $G$ whose chromatic number $χ (G)$ is more…