Discrete Mathematics, Volume 219

Volume 219, Number 1-3, May 2000

• Béla Bollobás, Oliver Riordan:
  Polychromatic polynomials. 1-7
  Electronic Edition (link) BibTeX
• Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska:
  Minimal reducible bounds for 1-nonouterplanar graphs. 9-15
  Electronic Edition (link) BibTeX
• Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang:
  Clique covering the edges of a locally cobipartite graph. 17-26
  Electronic Edition (link) BibTeX
• Bruce N. Cooperstein:
  A combinatorial construction of a graph with automorphism group SO⁺(2n, 2). 27-35
  Electronic Edition (link) BibTeX
• B. Corbas, Graham D. Williams:
  Congruence classes in M₃(F_q) (q odd). 37-47
  Electronic Edition (link) BibTeX
• Steven T. Dougherty, Masaaki Harada, Patrick Solé:
  Shadow lattices and shadow codes. 49-64
  Electronic Edition (link) BibTeX
• Ioana Dumitriu:
  On generalized Tribonacci sequences and additive partitions. 65-83
  Electronic Edition (link) BibTeX
• Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
  Bipartite Ramsey numbers and Zarankiewicz numbers. 85-95
  Electronic Edition (link) BibTeX
• Wolfgang Haas:
  Lower bounds for q-ary codes of covering radius one. 97-106
  Electronic Edition (link) BibTeX
• Günter Heinz:
  Lower and upper bounds on the total weight of semi-rich acyclic arrangements of oriented lines in the plane. 107-122
  Electronic Edition (link) BibTeX
• Robert Johansson:
  On the bipartite case of El-Zahárs conjecture. 123-134
  Electronic Edition (link) BibTeX
• Liying Kang, Mao-cheng Cai:
  Upper minus domination in regular graphs. 135-144
  Electronic Edition (link) BibTeX
• Hal A. Kierstead:
  Extending partial colorings of graphs. 145-152
  Electronic Edition (link) BibTeX
• Khee Meng Koh, Eng Guan Tay:
  On optimal orientations of G vertex-multiplications. 153-171
  Electronic Edition (link) BibTeX
• Clement W. H. Lam, Ying Miao:
  Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. 173-185
  Electronic Edition (link) BibTeX
• Max Landsberg:
  Feedback functions for generating cycles over a finite alphabet. 187-194
  Electronic Edition (link) BibTeX
• Rao Li:
  A Fan-type condition for claw-free graphs to be Hamiltonian. 195-205
  Electronic Edition (link) BibTeX
• Alan C. H. Ling, Charles J. Colbourn:
  Modified group divisible designs with block size four. 207-221
  Electronic Edition (link) BibTeX
• Hua Peng, Catherine Huafei Yan:
  On the discrepancy of strongly unimodular matrices. 223-233
  Electronic Edition (link) BibTeX
• Takao Ueda:
  Gray codes for necklaces. 235-248
  Electronic Edition (link) BibTeX
• Xiaomin Bao:
  On the blocking sets in S(3, 6, 22) and S(4, 7, 23). 249-252
  Electronic Edition (link) BibTeX
• Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
  Solution to a problem on degree sequences of graphs. 253-257
  Electronic Edition (link) BibTeX
• Rajendra S. Deodhar, Murali K. Srinivasan:
  Explicit semisymmetric chain decomposition of the partition lattice. 259-264
  Electronic Edition (link) BibTeX
• Laura L. Dolph, Annmarie Reynolds, James A. Sellers:
  Congruences for a restricted m-ary partition function. 265-269
  Electronic Edition (link) BibTeX
• Keith J. Edwards:
  Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi. 271-274
  Electronic Edition (link) BibTeX
• John Gimbel, Carsten Thomassen:
  Coloring triangle-free graphs with fixed size. 275-277
  Electronic Edition (link) BibTeX
• Solomon W. Golomb, Guang Gong, Zong-Duo Dai:
  Cyclic inequivalence of cascaded GMW-sequences. 279-285
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Riste Skrekovski:
  On median graphs and median grid graphs. 287-293
  Electronic Edition (link) BibTeX
• Frank Göring:
  Short proof of Menger's Theorem. 295-296
  Electronic Edition (link) BibTeX