Table of Contents

Volume 37 Issue 2 (March 2001)


How hard is it to determine if a graph has a 2‐role assignment?

  • Author: Fred S. Roberts, Li Sheng
  • Pub Online: Jan 04, 2018
  • DOI: 10.1002/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9 (p 67-73)

A branch and cut method for the degree‐constrained minimum spanning tree problem

  • Author: L. Caccetta, S.P. Hill
  • Pub Online: Feb 08, 2001
  • DOI: 10.1002/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E (p 74-83)

Embedding longest fault‐free paths in arrangement graphs with faulty vertices

  • Author: Ray‐Shang Lo, Gen‐Huey Chen
  • Pub Online: Feb 08, 2001
  • DOI: 10.1002/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-A (p 84-93)

Improved upper and lower bounds for k ‐broadcasting

  • Author: Hovhannes A. Harutyunyan, Arthur L. Liestman
  • Pub Online: Feb 08, 2001
  • DOI: 10.1002/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6 (p 94-101)

Scattering number in graphs

  • Author: Shenggui Zhang, Ziguo Wang
  • Pub Online: Feb 08, 2001
  • DOI: 10.1002/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S (p 102-106)

Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements

  • Author: Charles J. Colbourn, Peng‐Jun Wan
  • Pub Online: Feb 08, 2001
  • DOI: 10.1002/1097-0037(200103)37:2<107::AID-NET6>3.0.CO;2-A (p 107-116)

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.