On the computational complexity of partial covers of Theta graphs

Jirí Fiala, Jan Kratochvíl, Attila Pór. On the computational complexity of partial covers of Theta graphs. Electronic Notes in Discrete Mathematics, 19:79-85, 2005. [doi]

Abstract

Abstract is missing.