Discrete Mathematics, Volume 179

Volume 179, Numbers 1-3, January 1998

• Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy:
  The existence of uniquely -G colourable graphs. 1-11
  
• Ahmed Ainouche:
  Quasi-claw-free graphs. 13-26
  
• S. Ajoodani-Namini:
  All block designs with b = (_k^v)/2 exist. 27-35
  
• Richard P. Anstee, Lou Caccetta:
  Orthogonal matchings. 37-47
  
• Alberto Borobia, Valerio Chumillas:
  ^*-graphs of vertices of the generalized transitive tournament polytope. 49-57
  
• Alexandre V. Borovik, Israel M. Gelfand, Neil White:
  On exchange properties for Coxeter matroids and oriented matroids. 59-72
  
• Zhi-Hong Chen:
  Supereulerian graphs, independent sets, and degree-sum conditions. 73-87
  
• Fabien Durand:
  A characterization of substitutive sequences using return words. 89-101
  
• Hiroshi Era, Morimasa Tsuchiya:
  On upper bound graphs whose complements are also upper bound graphs. 103-109
  
• Gwihen Etienne, Michel Las Vergnas:
  External and internal elements of a matroid basis. 111-119
  
• Daniel A. Klain:
  Kinematic formulas for finite vector spaces. 121-132
  
• Robert Molina:
  The centroidal branches of a separable graph are edge reconstructible. 133-143
  
• Qaiser Mushtaq, Muhammad Aslam Noor:
  Group generated by two elements of orders two and six acting on R and Q(sqrt(n)). 145-154
  
• L. Petingi, F. Boesch, Charles L. Suffel:
  On the characterization of graphs with maximum number of spanning trees. 155-166
  
• Bernd S. W. Schröder:
  On CC-comparability invariance of the fixed point property. 167-183
  
• Haidong Wu:
  On contractible and vertically contractible elements in 3-connected matroids and graphs. 185-203
  
• Thomas Zaslavsky:
  Signed analogs of bipartite graphs. 205-216
  
• Elizabeth J. Billington, Dean G. Hoffman:
  The intersection problem for star designs. 217-222
  
• Béla Bollobás, Oliver Riordan:
  On some conjectures of Graffiti. 223-230
  
• Endre Boros, Vladimir Gurvich:
  A corrected version of the Duchet kernel conjecture. 231-233
  
• Sharon G. Boswell, Jamie Simpson:
  Edge-disjoint maximal planar graphs. 235-241
  
• C. J. Bouwkamp:
  On step-2 transforms for simple perfect squared squares. 243-252
  
• Emeric Deutsch:
  A bijection on Dyck paths and its consequences. 253-256
  
• Odile Favaron, Joël Puech:
  Irredundance in grids. 257-265
  
• Akira Higuchi:
  Lattices of closure operators. 267-272
  
• Tibor Jordán:
  On the existence of (k, l)-critical graphs. 273-275
  
• Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf:
  Basis partitions. 277-283
  
• Patric R. J. Östergård:
  On the structure of optimal error-correcting codes. 285-287
  
• Shuji Shiraishi:
  A remark on maximum matching of line graphs. 289-291