Chun-Hang Ge

collaborators

2 papers

math.CO2026

Edge-chromatic $4$ -critical graphs and Overfull Conjecture for graphs with maximum degree $4$

Chunhui Ge, Gregory Gutin, Xuli Qi

Let $G$ be a simple graph with maximum degree $I^ (G)$ and chromatic index $I ¨ ^{'} (G)$ . A graph $G$ is called edge-chromatic $I^$ -critical if $I ¨ ^{'} (G) = I^ (G) + 1$ and $I ¨ ^{'} (H) < I ¨ ^{'} (G)$ for…

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 $Ï…

Edge-chromatic 4-critical graphs and Overfull Conjecture for graphs with maximum degree 4

A new improvement to the Overfull Conjecture

Edge-chromatic $4$ -critical graphs and Overfull Conjecture for graphs with maximum degree $4$