Open access
Aug 2026
Signed list edge coloring in graphs of bounded treewidth
Vizing conjectured that the list edge chromatic number of any graph with maximum degree $\Delta$ is at most $\Delta + 1$. This conjecture has been confirmed for several important classes of graphs, in particular, Lang proved that it holds for all graphs of treewidth $3$. In this paper, we introduce the list edge colori...
Li Zhang, You Lu, Z. Miao et al.
· Discrete Applied Mathematics · 0 citations