Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete

Jacobson, MS and Kézdy, AE and Lehel, Jenő (1998) Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. NETWORKS, 31. pp. 1-10.

Full text not available from this repository.
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 14:54
Last Modified: 11 Dec 2012 14:54
URI: http://eprints.sztaki.hu/id/eprint/1710

Update Item Update Item