1. Algorithms for recognition of regular properties and decomposition of recursive graph families

   • R. Borie
   • R. Gary Parker
   • C. A. Tovey

   Section III Graph-Theoretical Aspects Of TND Pages: 125 - 149

2. The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds

   • Endre Boros
   • Peter L. Hammer

   Section III Graph-Theoretical Aspects Of TND Pages: 151 - 180

3. The image of weighted combinatorial problems

   • P. M. Camerini
   • G. Galbiati
   • F. Maffioli

   Section III Graph-Theoretical Aspects Of TND Pages: 181 - 197

4. Ancestor tree for arbitrary multi-terminal cut functions

   • C. K. Cheng
   • T. C. Hu

   Section III Graph-Theoretical Aspects Of TND Pages: 199 - 213

5. Multiterminal xcut problems

   • Refael Hassin

   Section III Graph-Theoretical Aspects Of TND Pages: 215 - 225

6. Some properties of graph centroids

   • W. Piotrowski
   • M. M. Sysło

   Section III Graph-Theoretical Aspects Of TND Pages: 227 - 236