Table of Contents

Volume 37 Issue 3 (May 2001)


Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs

  • Author: Falk Nicolai, Thomas Szymczak
  • Pub Online: Mar 28, 2001
  • DOI: 10.1002/net.1 (p 117-128)

On the number of spanning trees in directed circulant graphs

  • Author: Zbigniew Lonc, Krzysztof Parol, Jacek M. Wojciechowski
  • Pub Online: Mar 28, 2001
  • DOI: 10.1002/net.2 (p 129-133)

The capacitated arc routing problem with intermediate facilities

  • Author: Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
  • Pub Online: Mar 28, 2001
  • DOI: 10.1002/net.3 (p 134-143)

Multigraph augmentation under biconnectivity and general edge‐connectivity requirements

  • Author: Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
  • Pub Online: Jan 04, 2018
  • DOI: 10.1002/net.4 (p 144-155)

Minimum spanners of butterfly graphs

  • Author: Shien‐Ching Hwang, Gen‐Huey Chen
  • Pub Online: Mar 28, 2001
  • DOI: 10.1002/net.5 (p 156-164)

On the construction of combined k ‐fault‐tolerant Hamiltonian graphs

  • Author: Chun‐Nan Hung, Lih‐Hsing Hsu, Ting‐Yi Sung
  • Pub Online: Mar 28, 2001
  • DOI: 10.1002/net.6 (p 165-170)

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.