2 citations · 5 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
List Distinguishing Parameters of Trees
Michael Ferrara, Ellen Gethner, Stephen G. Hartke +2
A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D…
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…