6 citations · 13 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020★ 1 cited
An Extremal Problem on Rainbow Spanning Trees in Graphs
Matthew DeVilbiss, Bradley Fain, Amber Holmes +3
A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…
math.CO2020★ 3 cited
Distinguishing Generalized Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
A graph is -distinguishable if there is a coloring of the vertices with colors so that only the trivial automorphism preserves the color classes. The smallest such i…