Runze Wang

collaborators

2 papers

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…