Discrete Mathematics, Volume 185

Volume 185, Numbers 1-3, April 1998

• Toma Albu:
  Classes of lattices (co)generated by a lattice and their global (dual) Krull dimension. 1-18
  
• Jørgen Bang-Jensen, Jing Huang:
  Kings in quasi-transitive digraphs. 19-27
  
• Daniel K. Biss:
  A lower bound on the number of functions satisfying the strict avalanche criterion. 29-39
  
• Krzysztof Brys, Zbigniew Lonc:
  Clique and anticlique partitions of graphs. 41-49
  
• B. Corbas, Graham D. Williams:
  Matrix representatives for three-dimensional bilinear forms over finite fields. 51-61
  
• Nancy Eaton:
  Ramsey numbers for sparse graphs. 63-75
  
• Martin Klazar:
  On numbers of Davenport-Schinzel sequences. 77-87
  
• Thomas Niessen, Bert Randerath:
  Regular factors of simple regular graphs and factor-spectra. 89-103
  
• Gordon F. Royle:
  An orderly algorithm and some applications in finite geometry. 105-115
  
• Mateja Sajna:
  Half-transitivity of some metacirculants. 117-136
  
• Norbert Sauer:
  Edge partitions of the countable triangle free homogeneous graph. 137-181
  
• Stanley M. Selkow:
  The enumeration of labeled graphs by number of cutpoints. 183-191
  
• Claude Tardif:
  Graph products and the chromatic difference sequence of vertex-transitive graphs. 193-200
  
• Jianxing Yin:
  Some combinatorial constructions for optical orthogonal codes. 201-219
  
• Sanming Zhou:
  Interpolation theorems for graphs, hypergraphs and matroids. 221-229
  
• Hajo Broersma, Huib Trommel:
  Closure concepts for claw-free graphs. 231-238
  
• Beifang Chen, Sanming Zhou:
  Upper bounds for f-domination number of graphs^, . 239-243
  
• D. de Caen:
  An upper bound on the sum of squares of degrees in a graph. 245-248
  
• Mohamed H. El-Zahar, Lobna A. Fateen:
  On sphere orders. 249-253
  
• Johannes H. Hattingh, Michael A. Henning:
  Star-path bipartite Ramsey numbers^, . 255-258
  
• Sandi Klavzar:
  On the fractional chromatic number and the lexicographic product of graphs. 259-263
  
• Xinrong Ma:
  Nonexistence of extremal doubly even self-dual codes with large length. 265-274
  
• Artem V. Pyatkin:
  Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. 275-278
  
• Attila Sali, Gábor Simonyi:
  Intersecting set systems and graphic matroids^, . 279-285
  
• Saul Stahl:
  The multichromatic numbers of some Kneser graphs. 287-291
  
• Raphael Yuster:
  Linear coloring of graphs. 293-297