Yanru Feng

collaborators

2 papers

math.CO2026

On the Hilton-Zhao vertex-splitting conjecture

Xuli Qi, Yanrui Feng

Let $G$ be a simple graph with order $n$ , maximum degree $I^ (G)$ , and chromatic index $I ¨ ^{'} (G)$ , respectively. A graph $G$ is edge-chromatic critical if $I ¨ ^{'} (H) < I ¨ ^{'} (G)$ for every pr…

math.CO2025

A new improvement to the Overfull Conjecture

Xuli Qi, Chunhui Ge, Yanrui Feng

Let $G$ be a simple graph with order $n$ , maximum degree $\D(G)$, minimum degree $I^´ (G)$ and chromatic index $I ¨ ^{'} (G)$ , respectively. A graph $G$ is called {\em $\D$-critical} if $Ï…