Gexin Yu

activity

20142025

most citedOptimal open-locating-dominating sets in infinite triangular grids

8 citations · 11 across the 10 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2024★ 1 cited

On the $(1^{2}, 2^{4})$ -packing edge-coloring of subcubic graphs

Xujun Liu, Gexin Yu

An induced matching in a graph $G$ is a matching such that its end vertices also induce a matching. A $(1^{ℓ}, 2^{k})$ -packing edge-coloring of a graph $G$ is a partition of its e…

math.CO2023

A new connectivity bound for a tournament to be highly linked

Bin Chen, Xinmin Hou, Gexin Yu +1

A digraph $D$ is $k$ -linked if for any pair of two disjoint sets ${x_{1}, x_{2}, \dots, x_{k}}$ and ${y_{1}, y_{2}, \dots, y_{k}}$ of vertices in $D$ , there exist vertex disjoint d…

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…

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…

math.CO2014★ 1 cited

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable

Runrun Liu, Xiangwen Li, Gexin Yu

A $(c_{1}, c_{2}, ..., c_{k})$ -coloring of $G$ is a mapping $φ : V (G) \mapsto {1, 2, ..., k}$ such that for every $i, 1 \leq i \leq k$ , $G [V_{i}]$ has maximum degree at most $c_{i}$ , where $G [V_{i}]$ d…

On the (12,24)-packing edge-coloring of subcubic graphs