On the computational complexity of partial covers of theta graphs

Abstract

In the paper is classified computational complexity of several problems on graph covering, where the target graph is a theta graph.

Keywords

• computational
• complexity
• partial
• covers
• theta
• graphs