2 citations · 6 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016
Complexity and Computation of Connected Zero Forcing
Boris Brimkov
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum ze…
cs.DM2016
Characterizations of the Connected Forcing Number of a Graph
Boris Brimkov, Randy Davila
Zero forcing is a dynamic graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. This forcing process has been used to…