E-mail a Wiley Online Library Link

Asaf Levin, Daniel Paulusma and Gerhard J. Woeginger The computational complexity of graph contractions II: Two tough polynomially solvable cases Networks 52

Version of Record online: 9 APR 2008 | DOI: 10.1002/net.20249

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