Showing math.COShow all
2 papers · 1 filter
math.CO2025
A new improvement to the Overfull Conjecture
Xuli Qi, Chunhui Ge, Yanrui Feng
Let be a simple graph with order , maximum degree $\D(G)$, minimum degree and chromatic index , respectively. A graph is called {\em $\D$-critical} if $χ'(…
math.CO2022
Precoloring extension of Vizing's Theorem for multigraphs
Yan Cao, Guantao Chen, Guangming Jing +2
Let be a graph with maximum degree and maximum multiplicity . Vizing and Gupta, independently, proved in the 1960s that the chromatic index of is at most $Δ(G)…