19 citations · 24 across the 3 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 4 cited
On the Strong Chromatic Index of Sparse Graphs
Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7
The strong chromatic index of a graph , denoted , is the least number of colors needed to edge-color so that edges at distance at most two receive distinct colors.…
math.CO2015★ 1 cited
Color-blind index in graphs of very low degree
Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6
Let be an edge-coloring of a graph , not necessarily proper. For each vertex , let , where is the number of edges incident…