2 papers
math.CO2026
Degeneracy bounds, stability, and a sharp gap for -colorings
Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang
A -coloring of a graph is a proper edge-coloring in which every -cycle is rainbow, and denotes the minimum number of colors in such a coloring. Let denote t…
math.CO2026
D-coloring of planar graphs
Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang
A proper edge-coloring of a graph is a D-coloring if every subgraph isomorphic to is rainbow. The minimum number of colors in such a coloring is the D-chromatic index $…