Discrete Mathematics, Volume 301

Volume 301, Number 1, 28 September 2005

• Gábor Korchmáros:
  Preface. 1
  
• Vito Abatangelo, Bambina Larato:
  Near-MDS codes arising from algebraic curves. 5-19
  
• Marien Abreu, Domenico Labbate, Stephen C. Locke:
  6-path-connectivity and 6-generation. 20-27
  
• Angela Aguglia, Antonio Cossidente, Gary L. Ebert:
  On pairs of permutable Hermitian surfaces. 28-33
  
• A. Benini, F. Morini:
  Partially balanced incomplete block designs from weakly divisible nearrings. 34-45
  
• Andrea Blunck, Hans Havlicek:
  On bijections that preserve complementarity of subspaces. 46-56
  
• Anna de Mier, Marc Noy:
  Tutte uniqueness of line graphs. 57-65
  
• Nicola Durante, Pia Maria Lo Re, Domenico Olanda:
  On regular planar spaces of type (k, n). 66-73
  
• Sabine Giese, Hans Havlicek, Ralph-Hardo Schulz:
  Some constructions of divisible designs from Laguerre geometries. 74-82
  
• Vikram Jha, Norman L. Johnson:
  Transitive conical flocks of even order. 83-88
  
• Hans-Joachim Kroll, Rita Vincenti:
  PD-sets for the codes related to some classical varieties. 89-105
  
• Michel Lavrauw:
  Characterizations and properties of good eggs in PG(4n-1, q), q odd. 106-116
  
• Giovanni Lo Faro, Antoinette Tripodi:
  Strict colourings of STS(3v)s and uncolourable BSTS(3v)s. 117-123
  
• Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega:
  (delta, g)-cages with g geq 10 are 4-connected. 124-136
  
• Ron Shaw, Neil A. Gordon, Johannes G. Maks:
  Partial spreads in PG(4, 2) and flats in PG(9, 2) external to the Grassmannian G_{1, 4, 2}. 137-146
  

Volume 301, Numbers 2-3, 6 October 2005

• Gunnar Brinkmann, Brendan D. McKay:
  Construction of planar triangulations with minimum degree 5. 147-163
  
• Gennian Ge:
  On (g, 4;1)-difference matrices. 164-174
  
• Michael A. Henning, Jacob Elgin Maritz:
  Stratification and domination in graphs with minimum degree two. 175-194
  
• Hung-Chih Lee, Chiang Lin:
  Balanced star decompositions of regular multigraphs and lambda-fold complete bipartite graphs. 195-206
  
• Daniel C. Slilaty:
  On cographic matroids and signed-graphic matroids. 207-217
  
• Jian-Hua Yin, Jiong-Sheng Li:
  Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size. 218-227
  

• Ch. Sobhan Babu, Ajit A. Diwan:
  Degree conditions for forests in graphs. 228-231
  
• Jinlong Shu, Cun-Quan Zhang:
  A note about shortest cycle covers. 232-238
  
• Baogang Xu:
  Minimally circular-imperfect graphs with a major vertex. 239-242
  
• Zhongfu Zhang, Jianxun Zhang, Xinzhong Lu:
  The relation of matching with inverse degree of a graph. 243-246
  

• A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
  Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. 247