Wensong Lin

activity

20192022

collaborators

3 papers

math.CO2022

The tight bound for the strong chromatic indices of claw-free subcubic graphs

Yuquan Lin, Wensong Lin

Let $G$ be a graph and $k$ a positive integer. A strong $k$ -edge-coloring of $G$ is a mapping $ϕ : E (G) \to {1, 2, \dots, k}$ such that for any two edges $e$ and $e^{'}$ that are either…

math.CO2021

On t-relaxed coloring of complete multi-partite graphs

Jun Lan, Wensong Lin

Let $G$ be a graph and $t$ a nonnegative integer. Suppose $f$ is a mapping from the vertex set of $G$ to ${1, 2, \dots, k}$ . If, for any vertex $u$ of $G$ , the number of neighbors…

math.CO2019

On $t$ -relaxed 2-distant circular coloring of graphs

Dan He, Wensong Lin

Let $k$ be an positive integer. For any two integers $i$ and $j$ in ${0, 1, \dots, k - 1}$ , let $∣ i - j ∣_{k} = min {∣ i - j ∣, k - ∣ i - j ∣}$ be the circular distance between $i$ and $j$ . Let $t$ b…

The tight bound for the strong chromatic indices of claw-free subcubic graphs

On t-relaxed coloring of complete multi-partite graphs

On t-relaxed 2-distant circular coloring of graphs

On $t$ -relaxed 2-distant circular coloring of graphs