Discrete Applied Mathematics, Volume 132

Volume 132, Number 1-3, 15 October 2003

• Vadim V. Lozin, Dominique de Werra:
  Special issue on stability in graphs and related topics. 1-2
  
• Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
  Powers of geometric intersection graphs and dispersion algorithms. 3-16
  
• Vladimir E. Alekseev:
  On easy and hard hereditary classes of graphs with respect to the independent set problem. 17-26
  
• Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra:
  Struction revisited. 27-46
  
• Andreas Brandstädt, Raffaele Mosca:
  On the structure and stability number of P₅- and co-chair-free graphs. 47-65
  
• Jou-Ming Chang:
  Induced matchings in asteroidal triple-free graphs. 67-78
  
• Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp:
  On local and global independence numbers of a graph. 79-84
  
• Odile Favaron:
  Independence and upper irredundance in claw-free graphs. 85-95
  
• Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer:
  On well-covered triangulations: Part I. 97-108
  
• Michael U. Gerber, Alain Hertz, David Schindl:
  P₅-free augmenting graphs and the maximum stable set problem. 109-119
  
• Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
  Stable sets in two subclasses of banner-free graphs. 121-136
  
• Victor P. Il'ev:
  Hereditary systems and greedy-type algorithms. 137-148
  
• Ephraim Korach, Uri N. Peled:
  Equistable series-parallel graphs. 149-162
  
• Vadim E. Levit, Eugen Mandrescu:
  Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. 163-174
  
• Raffaele Mosca:
  Some results on maximum stable sets in certain P₅-free graphs. 175-183
  
• G. Oriolo:
  Clique family inequalities for the stable set polytope of quasi-line graphs. 185-201
  
• Uri N. Peled, Udi Rotics:
  Equistable chordal graphs. 203-210
  
• Igor E. Zverovich:
  Minimum degree algorithms for stability number. 211-216