Discrete Mathematics, Volume 138

Volume 138, Numbers 1-3, March 1995

• Douglas R. Woodall:
  Preface. 1-3
  
• Tobias Adelgren:
  Triangle-free eulerian tours in graphs with maximum degree at most 4. 5-14
  
• F. Aguiló, Miguel Angel Fiol:
  An efficient algorithm to find optimal double loop networks. 15-29
  
• Ian Anderson, S. D. Cohen, Norman J. Finizio:
  An existence theorem for cyclic triplewhist tournaments. 31-41
  
• Martin Anthony, Graham Brightwell, Colin Cooper:
  The vapnik-chervonenkis dimension of a random graph. 43-56
  
• Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
  On set systems without weak 3-Delta-subsystems. 57-62
  
• Jørgen Bang-Jensen, Gregory Gutin, Jing Huang:
  Weakly Hamiltonian-connected ordinary multipartite tournaments. 63-74
  
• Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
  Hereditarily hard H-colouring problems. 75-92
  
• Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary:
  Size in maximal triangle-free graphs and minimal graphs of diameter 2. 93-99
  
• Bruce L. Bauslaugh:
  Core-like properties of infinite graphs and structures. 101-111
  
• Jürgen Bierbrauer:
  A family of 4-designs with block size 9. 113-117
  
• Andrew Bowler:
  On the fixed points of an automorphism of a symmetric design. 119-124
  
• Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae:
  Majority domination in graphs. 125-135
  
• Andries E. Brouwer:
  Variations on a theme by Weetman. 137-145
  
• Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra:
  On Cayley line digraphs. 147-159
  
• Darryn E. Bryant, Sheila Oates-Williams:
  Mendelsohn designs associated with a class of idempotent quasigroups. 161-167
  
• Marco Buratti:
  Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5. 169-175
  
• Yair Caro, Yehuda Roditty, J. Schönheim:
  On colored designs - II. 177-186
  
• Robin J. Chapman, Bridget S. Webb:
  A note on a lemma of Brauer. 187-191
  
• D. V. Chopra:
  On arrays with some combinatorial structure. 193-198
  
• Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt:
  On a Nordhaus-Gaddum type problem for independent domination. 199-205
  
• Peter Cowling:
  Strong total chromatic numbers of complete hypergraphs. 207-212
  
• Dragos Cvetkovic, Slobodan K. Simic:
  On graphs whose second largest eigenvalue does not exceed (sqrt(5)-1)/2. 213-227
  
• Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar:
  Nearly perfect sets in graphs. 229-246
  
• Mike J. Grannell, Terry S. Griggs, J. S. Phelan:
  Continuity of Mendelsohn and Steiner triple systems. 247-253
  
• Egbert Harzheim:
  On weakly arithmetic progressions. 255-260
  
• Robert Hochberg, Colin McDiarmid, Michael E. Saks:
  On the bandwidth of triangulated triangles. 261-265
  
• S. G. Hoggar, I. McFarlane:
  Faster fractal pictures by finite fields and far rings. 267-280
  
• R. Hughes-Jones:
  Enumerating uniform polyhedral surfaces with triangular faces. 281-292
  
• Derek Jennings:
  On packings of squares and rectangles. 293-300
  
• Sandi Klavzar, Bojan Mohar:
  The chromatic numbers of graph bundles over cycles. 301-314
  
• Richard P. Lewis, Simon P. Norton:
  On a problem raised by P.J. Cameron. 315-318
  
• A. Meir, J. W. Moon:
  On path entropy functions for rooted trees. 319-326
  
• K. G. Paterson, Matthew J. B. Robshaw:
  Storage efficient decoding for a class of binary be Bruijn sequences. 327-341
  
• Donald A. Preece:
  How many 7 × 7 latin squares can be partitioned into Youden squares? 343-352
  
• Donald A. Preece, B. J. Vowden:
  Graeco-Latin squares with embedded balanced superimpositions of Youden squares. 353-363
  
• Zdenek Ryjácek, Ingo Schiermeyer:
  On the independence number in K_{1, r+1}-free graphs. 365-374
  
• Abdón Sánchez-Arroyo:
  A new upper bound for total colourings of graphs. 375-377
  
• E. van Blanken, J. van den Heuvel, Henk Jan Veldman:
  Pancyclicity of hamiltonian line graphs. 379-385
  
• Nguyen Van Ngoc, Zsolt Tuza:
  4-chromatic graphs with large odd girth. 387-392
  
• Douglas B. West:
  Acyclic orientations of complete bipartite graphs. 393-396
  
• Peter R. Wild:
  Some families of semibiplanes. 397-403