E-mail a Wiley Online Library Link

Asaf Levin, Daniel Paulusma and Gerhard J. Woeginger The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases Networks 51

Version of Record online: 14 DEC 2007 | DOI: 10.1002/net.20214

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field