Guantao Chen

collaborators

2 papers

math.CO2026

Odd-Girth Bounds for Defective Edge Coloring

Guantao Chen, Alireza Fiujlaali

A $(k, d)$ -edge coloring of a loopless multigraph $G$ is an edge coloring using at most $k$ colors such that the subgraph formed by each color class has maximum degree at most $d$ .…

math.CO2026

On graphs with girth at least five achieving Steffen's edge coloring bound

Guantao Chen, Alireza Fiujlaali, Anna Johnsen-Yu +1

Vizing and Gupta showed that the chromatic index $I ¨ ^{'} (G)$ of a graph $G$ is bounded above by $I^ (G) + I^¼ (G)$ , where $I^ (G)$ and $I^¼ (G)$ denote the maximum degree and the maximum mu…