Discrete Mathematics, Volume 284

Volume 284, Number 1-3, July 2004

• Christopher A. Rodger, Dean G. Hoffman:
  Preface. 1-7
  
• Izabela Adamczak, Donald L. Kreher, Rolf S. Rees:
  Tight incomplete block designs. 11-20
  
• Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse:
  Some equitably 3-colourable cycle decompositions. 21-35
  
• Dan Archdeacon, Marisa Debowsky, Jeffrey H. Dinitz, Heather Gavlas:
  Cycle systems in the complete bipartite graph minus a one-factor. 37-43
  
• Frank E. Bennett, Hantao Zhang:
  Latin Squares with Self-Orthogonal Conjugates. 45-55
  
• Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu:
  Grooming in unidirectional rings: K₄-e designs. 57-62
  
• Elizabeth J. Billington:
  The extended metamorphosis of a complete bipartite design into a cycle system. 63-70
  
• Andrew Blinco, Saad El-Zanati, Charles Vanden Eynden:
  On the cyclic decomposition of complete graphs into almost-bipartite graphs. 71-81
  
• Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb:
  Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. 83-95
  
• Nicholas J. Cavenagh, Diane Donovan, Ales Drápal:
  Constructing and deconstructing latin trades. 97-105
  
• Peter Danziger, Eric Mendelsohn, Gaetano Quattrocchi:
  On the chromatic index of path decompositions. 107-121
  
• Gary L. Ebert:
  Quasimultiples of geometric designs. 123-129
  
• Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger:
  Decomposing K_ncupP into triangles. 131-136
  
• Mario Gionfriddo, Gaetano Quattrocchi:
  Colouring 4-cycle systems with equitably coloured blocks. 137-148
  
• Alan Hartman, Leonid Raskin:
  Problems and algorithms for covering arrays. 149-156
  
• Anthony J. W. Hilton, Matthew Johnson:
  Amalgamations of factorizations of complete equipartite graphs. 157-175
  
• Dean G. Hoffman:
  The real truth about star designs. 177-180
  
• Peter Horák, Roman Nedela, Alexander Rosa:
  The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors. 181-188
  
• Spencer P. Hurd, Dinesh G. Sarvate:
  Odd and even group divisible designs with two groups and block size four. 189-196
  
• Giovanni Lo Faro, Antoinette Tripodi:
  Triplication for BSTSs and uncolourability. 197-203
  
• Aygul Mamut, David A. Pike, Michael Edwin Raines:
  Pancyclic BIBD block-intersection graphs. 205-208
  
• Rudolf Mathon, Anne Penfold Street:
  Mixed partitions of sets of triples into small planes. 209-215
  
• J. W. McGee, Christopher A. Rodger:
  Embedding coverings of 2-paths with 3-paths. 217-223
  
• Salvatore Milici:
  Coverings of a complete graph with five-vertex and five-edge graphs. 225-229
  
• Akihiro Munemasa, Vladimir D. Tonchev:
  A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. 231-234
  
• Renwang Su, Hung-Lin Fu, Hao Shen:
  Embeddings of maximum packings in triple systems. 235-245