Discrete Mathematics, Volume 240

Volume 240, Number 1-3, September 2001

• Jürgen Bierbrauer:
  An infinite family of 7-designs. 1-11
  Electronic Edition (link) BibTeX
• Galina T. Bogdanova, Patric R. J. Östergård:
  Bounds on codes over an alphabet of five elements. 13-19
  Electronic Edition (link) BibTeX
• Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu:
  Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. 21-43
  Electronic Edition (link) BibTeX
• Neil Hindman, Randall McCutcheon:
  VIP systems in partial semigroups. 45-70
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
  Hamiltonian cycles in n-factor-critical graphs. 71-82
  Electronic Edition (link) BibTeX
• André E. Kézdy, Matthew Scobee:
  A proof of Hougardy's conjecture for diamond-free graphs. 83-95
  Electronic Edition (link) BibTeX
• James F. Korsh:
  Loopless generation of up-down permutations. 97-122
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Douglas R. Woodall:
  Choosability conjectures and multicircuits. 123-143
  Electronic Edition (link) BibTeX
• Salvatore Milici, Alex Rosa, Vitaly I. Voloshin:
  Colouring Steiner systems with specified block colour patterns. 145-160
  Electronic Edition (link) BibTeX
• Donald Mills:
  Factorizations of root-based polynomial compositions. 161-173
  Electronic Edition (link) BibTeX
• Hiroshi Nagamochi, Mirka Miller, Slamin:
  Bounds on the number of isolates in sum graph labeling. 175-185
  Electronic Edition (link) BibTeX
• Seiya Negami:
  Diagonal flips in pseudo-triangulations on closed surfaces. 187-196
  Electronic Edition (link) BibTeX
• Michel Sebille:
  An extension theorem for t-designs. 197-204
  Electronic Edition (link) BibTeX
• Hsin-Min Sun:
  Segments in a planar nearring. 205-217
  Electronic Edition (link) BibTeX
• Wang Yan, Bolian Liu:
  Some results on integral sum graphs. 219-229
  Electronic Edition (link) BibTeX
• S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam:
  Graphs whose acyclic graphoidal covering number is one less than its maximum degree. 231-237
  Electronic Edition (link) BibTeX
• Richard A. Brualdi, Susan Hollingsworth:
  Multicolored forests in complete bipartite graphs. 239-245
  Electronic Edition (link) BibTeX
• Miranca Fischermann:
  Block graphs with unique minimum dominating sets. 247-251
  Electronic Edition (link) BibTeX
• Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines:
  Covering hypercubes by isometric paths. 253-260
  Electronic Edition (link) BibTeX
• Qiongxiang Huang, An Chang:
  Circulant digraphs determined by their spectra. 261-270
  Electronic Edition (link) BibTeX
• Manoel Lemos:
  On Mills's conjecture on matroids with many common bases. 271-276
  Electronic Edition (link) BibTeX
• Hossein Shahmohamad:
  Some flow-equivalent planar and non-planar graphs. 277-280
  Electronic Edition (link) BibTeX
• Masato Tomiyama:
  On the primitive idempotents of distance-regular graphs. 281-294
  Electronic Edition (link) BibTeX
• Qin Wang, Jinjiang Yuan:
  Maximal IM-unextendable graphs. 295-298
  Electronic Edition (link) BibTeX