Block reduction conjecture for graph covers
Block reduction conjecture. The problem \scH-Cover{\sc H\text{-}Cover}\scH-Cover for simple input graphs polynomially reduces to \scH′-Cover{\sc H'\text{-}Cover}\scH′-Cover for simple input graphs.