Runze Wang

activity

20242026

collaborators

6 papers

math.CO2026

A note on the injective edge coloring of graphs with bounded maximum degree

Lin Tian, Runze Wang

Let $G$ be a graph. Under an \emph{injective edge coloring} of $G$ , any two edges at distance $2$ or belonging to a common triangle receive distinct colors. The \emph{injective chr…

math.CO2026

A stronger upper bound on the D-chromatic index

Lin Tian, Runze Wang

For a graph $G$ , a proper edge coloring of $G$ is called a D-coloring if every diamond subgraph of $G$ is rainbow. Let $χ_{D}^{'} (G)$ be the D-chromatic index of $G$ , which is the small…

math.CO2026

Proper edge coloring with rainbow diamonds

Runze Wang

Motivated by the B-coloring defined by Gyárfás and Sárközy, we introduce a new edge coloring called \emph{D-coloring}. For a graph $G$ , a D-coloring of $G$ is a proper edge colorin…

math.CO2026

Strong edge-coloring of sparse graphs with Ore-degree 7 or 8

Runze Wang

In a strong edge-coloring of a graph $G = (V, E)$ , any two edges of distance at most $2$ get distinct colors. The strong chromatic index of $G$ , denoted by $χ_{s}^{'} (G)$ , is the minimum n…

math.CO2025

Strong edge-coloring of graphs with maximum edge weight seven

Runze Wang

A strong edge-coloring of a graph $G$ is an edge-coloring such that any two edges of distance at most two receive distinct colors. The minimum number of colors we need in order to…

math.CO2024

A biased edge coloring game

Runze Wang

We combine the ideas of edge coloring games and asymmetric graph coloring games and define the \emph{ $(m, 1)$ -edge coloring game}, which is alternatively played by two players Maker…