15 citations · 66 across the 29 of their papers we have counts for
Showing 2016Show all
4 papers · 1 filter
math.CO2016
Vizing's conjecture for cographs
Elliot Krop
We show that if is a cograph, that is -free, then for any graph , . By the characterization of cographs as a finite sequence of unions and j…
math.CO2016★ 2 cited
A new bound for Vizing's conjecture
Elliot Krop, Kimber Wolff
For any graph , we define the power as the minimum of the largest number of neighbors in a -set of , of any vertex, taken over all -sets of . We show that $γ(…
math.CO2016★ 3 cited
Vizing's conjecture: a two-thirds bound for claw-free graphs
Elliot Krop
We show that for any claw-free graph and any graph , , where is the domination number of .
math.CO2016★ 3 cited
All trees are six-cordial
Keith Driscoll, Elliot Krop, Michelle Nguyen
For any integer , a tree is -cordial if there exists a labeling of the vertices of by , inducing a labeling on the edges with edge-weights found by su…