Discrete Mathematics, Volume 100

Volume 100, Numbers 1-3, May 1992

• Piet Hein: Problems worthy of attack prove their worth by hitting back. 3
• Jesper Lützen, Gert Sabidussi, Bjarne Toft:
  Julius Petersen 1839-1910 a biography. 9-82
  
• Margit Christiansen, Jesper Lützen, Gert Sabidussi, Bjarne Toft:
  Julius Petersen annotated bibliography. 83-97
  
• Gert Sabidussi:
  Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891. 99-155
  
• Henry Martyn Mulder:
  Julius Petersen's theory of regular graphs. 157-175
  
• Michael D. Plummer:
  Matching theory - a sampler: from Dénes König to the present. 177-219
  
• Piet Hein: We shall have to evolve problem solvers galore Since each problem we solve creates ten problems more. 221
• H. L. Abbott, Bing Zhou:
  On a conjecture of Gallai concerning complete subgraphs of k-critical graphs. 223-228
  
• Yousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang:
  On total covers of graphs. 229-233
  
• Michael O. Albertson:
  Turán theorems with repeated degrees. 235-241
  
• Jørgen Bang-Jensen:
  On the structure of locally semicomplete digraphs. 243-265
  
• M. Biró, Mihály Hujter, Zsolt Tuza:
  Precoloring extension. I. Interval graphs. 267-279
  
• Oleg V. Borodin:
  Cyclic coloring of plane graphs. 281-289
  
• R. L. Brooks, C. A. B. Smith, A. H. Stone, W. T. Tutte:
  Determinants and current flows in electric networks. 291-301
  
• Gary Chartrand, Héctor Hevia, Robin J. Wilson:
  The ubiquitous Petersen graph. 303-311
  
• Reinhard Diestel:
  The end structure of a graph: recent results and open problems. 313-327