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

3 papers · 1 filter

math.CO2023

Cliques in Squares of Graphs with Maximum Average Degree less than 4

Daniel W. Cranston, Gexin Yu

Hocquard, Kim, and Pierron constructed, for every even integer $D \geq 2$ , a 2-degenerate graph $G_{D}$ with maximum degree $D$ such that $ω (G_{D}^{2}) = \frac{5}{2} D$ . We prove for (a) all 2-de…

math.CO2023

A sufficient condition for a hypergraph to have a Berge- $k$ -factor

Yuping Gao, Songling Shan, Gexin Yu

For any graph (hypergraph) $G$ with vertex set $V$ and edge set $E$ , we define its incidence bipartite graph $I (G)$ as the bipartite graph with bipartition $(E, V)$ , wher…

math.CO2023

Strong edge-coloring of 2-degenerate graphs

Gexin Yu, Rachel Yu

A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $χ_{s}^{'} (G)$ is the minimum number of color…

Cliques in Squares of Graphs with Maximum Average Degree less than 4

A sufficient condition for a hypergraph to have a Berge-k-factor

Strong edge-coloring of 2-degenerate graphs

A sufficient condition for a hypergraph to have a Berge- $k$ -factor