Discrete Mathematics, Volume 293

Volume 293, Number 1-3, April 2005

• Douglas R. Woodall:
  Preface. 1-
  Electronic Edition (link) BibTeX
• Guest editor listing. 3- BibTeX
• Moncef Abbas, Sadek Bouroubi:
  On new identities for Bell's polynomials. 5-10
  Electronic Edition (link) BibTeX
• Ian Anderson, Leigh H. M. Ellison:
  Z-cyclic ordered triplewhist tournaments on p elements, where p=5 (mod 8). 11-17
  Electronic Edition (link) BibTeX
• Ian Anderson, Norman J. Finizio:
  Some new Z-cyclic whist tournament designs. 19-28
  Electronic Edition (link) BibTeX
• Ian Anderson, Donald A. Preece:
  Some power-sequence terraces for Z_pq with as few segments as possible. 29-59
  Electronic Edition (link) BibTeX
• Kiyoshi Ando:
  Trivially noncontractible edges in a contraction critically 5-connected graph. 61-72
  Electronic Edition (link) BibTeX
• R. A. Bailey:
  Balanced colourings of strongly regular graphs. 73-90
  Electronic Edition (link) BibTeX
• Peter J. Cameron, Ian M. Wanless:
  Covering radius for sets of permutations. 91-109
  Electronic Edition (link) BibTeX
• Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
  Ramsey degrees of bipartite graphs: A primitive recursive proof. 111-119
  Electronic Edition (link) BibTeX
• Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian:
  On the size of the minimum critical set of a Latin square. 121-127
  Electronic Edition (link) BibTeX
• Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar:
  Generalized subgraph-restricted matchings in graphs. 129-138
  Electronic Edition (link) BibTeX
• M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
  On the Steiner, geodetic and hull numbers of graphs. 139-154
  Electronic Edition (link) BibTeX
• Fred C. Holroyd, Claire Spencer, John M. Talbot:
  Compression and Erdo"s-Ko-Rado graphs. 155-164
  Electronic Edition (link) BibTeX
• Fred C. Holroyd, John M. Talbot:
  Graphs with the Erdös-Ko-Rado property. 165-176
  Electronic Edition (link) BibTeX
• Leif K. Jørgensen:
  Girth 5 graphs from relative difference sets. 177-184
  Electronic Edition (link) BibTeX
• Nicolas Lichiardopol:
  Independence number of iterated line digraphs. 185-193
  Electronic Edition (link) BibTeX
• Tatsuya Maruta:
  Extendability of quaternary linear codes. 195-203
  Electronic Edition (link) BibTeX
• Philip Maynard, Johannes Siemons:
  Efficient reconstruction of partitions. 205-211
  Electronic Edition (link) BibTeX
• Nicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis:
  The seven classes of 5×6 triple arrays. 213-218
  Electronic Edition (link) BibTeX
• José Luis Ruiz, Mercè Mora:
  De Bruijn and Kautz digraphs of a rooted tree. 219-236
  Electronic Edition (link) BibTeX
• Karen Seyffarth, Chengde Wang:
  On eulerian and regular perfect path double covers of graphs. 237-250
  Electronic Edition (link) BibTeX
• Rueiher Tsaur:
  The Baillon-Simons theorems. 251-261
  Electronic Edition (link) BibTeX
• Timothy R. Walsh:
  Efficient enumeration of sensed planar maps. 263-289
  Electronic Edition (link) BibTeX
• Igor E. Zverovich, Vadim E. Zverovich:
  Basic perfect graphs and their extensions. 291-311
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  Research problems from the 19th British Combinatorial Conference. 313-320
  Electronic Edition (link) BibTeX