Networks

Cover image for Networks

May 2008

Volume 51, Issue 3

Pages 155–209

    1. w-Rabin numbers and strong w-Rabin numbers of folded hypercubes (pages 171–177)

      Cheng-Nan Lai and Gen-Huey Chen

      Article first published online: 14 DEC 2007 | DOI: 10.1002/net.20213

    2. The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (pages 178–189)

      Asaf Levin, Daniel Paulusma and Gerhard J. Woeginger

      Article first published online: 14 DEC 2007 | DOI: 10.1002/net.20214

    3. Sufficient conditions for a graph to be super restricted edge-connected (pages 200–209)

      Shiying Wang and Shangwei Lin

      Article first published online: 14 DEC 2007 | DOI: 10.1002/net.20217

SEARCH

SEARCH BY CITATION