Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs

摘要

This paper presents new complexity and non-approximation results concerning two color propagation problems, namely POWER EDGE SET and ZERO FORCING SET. We focus on cubic graphs, exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for ZERO FORCING Set in proper interval graphs.