Discrete Mathematics, Volume 268

Volume 268, Number 1-3, July 2003

• R. Julian R. Abel, Norman J. Finizio, Malcolm Greig, Scott J. Lewis:
  Generalized whist tournament designs. 1-19
  Electronic Edition (link) BibTeX
• Jungmin Ahn, Hyun Kwang Kim, Jung Soo Kim, Mina Kim:
  Classification of perfect linear codes with crown poset structure. 21-30
  Electronic Edition (link) BibTeX
• Maria Axenovich:
  On multiple coverings of the infinite rectangular grid with balls of constant radius. 31-48
  Electronic Edition (link) BibTeX
• R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu:
  On Hamilton cycle decompositions of the tensor product of complete graphs. 49-58
  Electronic Edition (link) BibTeX
• Andrei A. Bulatov, Pawel M. Idziak:
  Counting Mal'tsev clones on small sets. 59-80
  Electronic Edition (link) BibTeX
• Marc Chastand:
  Fiber-complemented graphs II. Retractions and endomorphisms. 81-101
  Electronic Edition (link) BibTeX
• Iwan M. Duursma:
  Extremal weight enumerators and ultraspherical polynomials. 103-127
  Electronic Edition (link) BibTeX
• Elaine M. Eschen, William Klostermeyer, R. Sritharan:
  Planar domination graphs. 129-137
  Electronic Edition (link) BibTeX
• Gennian Ge, Clement W. H. Lam:
  Resolvable group divisible designs with block size four and group size six. 139-151
  Electronic Edition (link) BibTeX
• Clemens Heuberger:
  On planarity and colorability of circulant graphs. 153-169
  Electronic Edition (link) BibTeX
• Darla Kremer, Wai Chee Shiu:
  Finite transition matrices for permutations avoiding pairs of length four patterns. 171-183
  Electronic Edition (link) BibTeX
• Rao Li, Richard H. Schelp:
  Every 3-connected distance claw-free graph is Hamilton-connected. 185-197
  Electronic Edition (link) BibTeX
• Xuechao Li, Cun-Quan Zhang:
  Chords of longest circuits in 3-connected graphs. 199-206
  Electronic Edition (link) BibTeX
• Seiya Negami:
  Composite planar coverings of graphs. 207-216
  Electronic Edition (link) BibTeX
• Hidefumi Ohsugi, Takayuki Hibi:
  Normalized volumes of configurations related with root systems and complete bipartite graphs. 217-242
  Electronic Edition (link) BibTeX
• Erich Prisner:
  The recognition problem for line bigraphs. 243-256
  Electronic Edition (link) BibTeX
• J. K. Truss:
  The automorphism group of the random graph: four conjugates good, three conjugates better. 257-271
  Electronic Edition (link) BibTeX
• Bao-Yin Zhang, Jie Li:
  An improvement of the two-line algorithm for proving q-hypergeometric identities. 273-286
  Electronic Edition (link) BibTeX
• Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih:
  The existence of hyper-L triple-loop networks. 287-291
  Electronic Edition (link) BibTeX
• Gennian Ge, Clement W. H. Lam:
  Bhaskar Rao designs with block size four. 293-298
  Electronic Edition (link) BibTeX
• Wayne Goddard, Michael A. Henning:
  Nordhaus-Gaddum bounds for independent domination. 299-302
  Electronic Edition (link) BibTeX
• Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
  On a list-coloring problem. 303-308
  Electronic Edition (link) BibTeX
• Victor J. W. Guo:
  A simple proof of Dixon's identity. 309-310
  Electronic Edition (link) BibTeX
• Frank Kwang-Ming Hwang:
  On Macula's error-correcting pool designs. 311-314
  Electronic Edition (link) BibTeX
• Hermann Mierendorff:
  Magic twin body stars generated from chains of prismoids. 315-323
  Electronic Edition (link) BibTeX
• Reza Naserasr, Riste Skrekovski:
  The Petersen graph is not 3-edge-colorable--a new proof. 325-326
  Electronic Edition (link) BibTeX
• Micha Sharir, Shakhar Smorodinsky:
  On neighbors in geometric permutations. 327-335
  Electronic Edition (link) BibTeX
• Dong-Joon Shin, Wonjin Sung:
  A new Kloosterman sum identity over F₂m for odd m. 337-341
  Electronic Edition (link) BibTeX
• Lie Zhu, Hantao Zhang:
  Completing the spectrum of r-orthogonal Latin squares. 343-349
  Electronic Edition (link) BibTeX