Discrete Mathematics, Volume 124

Volume 124, Numbers 1-3, January 1994

• S. Fiorini, Josef Lauri:
  Preface. 1
  
• Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
  Edge-integrity: a survey. 3-12
  
• Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
  On the complexity of recognizing tough graphs. 13-17
  
• Norman Biggs:
  Combinatorics and connectionism. 19-36
  
• H. J. Broersma, Ingo Schiermeyer:
  A closure concept based on neighborhood unions of independent triples. 37-47
  
• Andries E. Brouwer, Minoru Numata:
  A characterization of some graphs which do not contain 3-claws. 49-54
  
• Italo J. Dejter:
  On symmetric subgraphs of the 7-cube: an overview. 55-66
  
• Miguel Angel Fiol:
  The superconnectivity of large digraphs and graphs. 67-78
  
• Mario Gionfriddo, Zsolt Tuza:
  On conjectures of Berge and Chvátal. 79-86
  
• Harald Gropp:
  Nonsymmetric configurations with natural index. 87-98
  
• Frank Harary:
  Sum graphs over all the integers. 99-105
  
• Alan Hartman:
  The fundamental construction for 3-designs. 107-132
  
• Ilia Krasikov, J. Schönheim:
  On near subgroups. 133-136
  
• L. Lovász:
  Stable sets and polynomials. 137-153
  
• Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
  Total colouring regular bipartite graphs is NP-hard. 155-162
  
• J. W. Moon:
  Some determinant expansions and the matrix-tree theorem. 163-171
  
• E. Sampathkumar, G. D. Kamath:
  A generalization of chromatic index. 173-177
  
• Jozef Sirán, Martin Skoviera:
  Regular maps from Cayley graphs II antibalanced Cayley maps. 179-191
  
• Bhalchandra D. Thatte:
  Some results and approaches for reconstruction conjectures. 193-216
  
• Carsten Thomassen:
  Embeddings of graphs. 217-228
  
• Henk Jan Veldman:
  On dominating and spanning circuits in graphs. 229-239
  
• Preben D. Vestergaard:
  Two-cacti with minimum number of spanning trees. 241-250
  
• D. J. A. Welsh:
  The computational complexity of knot and matroid polynomials. 251-269