18 citations · 59 across the 14 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Local version of Vizing's theorem for multi-graphs
Clinton T. Conley, Jan Grebik, Oleg Pikhurko
Extending a result of Christiansen, we prove that every mutli-graph admits a proper edge colouring which is local, that is, $ϕ(e)\le \max\{d(x)+π(x…
math.CO2019★ 1 cited
Equitable Colorings of Borel Graphs
Anton Bernshteyn, Clinton T. Conley
Hajnal and Szemerédi proved that if is a finite graph with maximum degree , then for every integer , has a proper coloring with colors in which ever…