Sciweavers

DAM
2008

On the computational complexity of partial covers of Theta graphs

14 years 20 days ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields then the NP-hardness of the decision problem on the existence of locally injective homomorphisms to certain Theta graphs.
Jirí Fiala, Jan Kratochvíl, Attila P
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DAM
Authors Jirí Fiala, Jan Kratochvíl, Attila Pór
Comments (0)