Jennifer Diemunsch

most citedColor-blind index in graphs of very low degree

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2015★ 1 cited

Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c : E (G) \to [k]$ be an edge-coloring of a graph $G$ , not necessarily proper. For each vertex $v$ , let $c ˉ (v) = (a_{1}, \dots, a_{k})$ , where $a_{i}$ is the number of edges incident…

math.CO2011

Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs

Jennifer Diemunsch, Michael Ferrara, Casey Moffatt +2

A {\it rainbow matching} in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edge-colore…