Volume 63, April 2002

• 
  Kevin L. Chouinard: On weight distributions of codes of planes of order 9.
• 
  David S. Gunderson: On Deuber's partition theorem for (m, p, c)-sets.
• 
  Raluca Muntean, Ping Zhang: k-Geodomination in graphs.
• 
  Spencer P. Hurd, Dinesh G. Sarvate: On c-Hadamard matrices.
• 
  A. Gutiérrez, Anna S. Lladó: On the edge-residual number and the line completion number of a graph.
• 
  Charles Laywine, Gary L. Mullen: A hierarchy of complete orthogonal structures.
• 
  Richard Hammack: A note on the complexity of computing cyclicity.
• 
  Catherine Baker, Anthony Bonato, Patrick Kergin: Skolem arrays and skolem labellings of ladder graphs.
• 
  Antonio Cossidente, Vito Napolitano: Classical varieties and caps.
• 
  M. M. Parmenter: On groups with redundancy in multiplication.
• 
  Ruth Haas: Characterizations of arboricity of graphs.
• 
  Jeh Gwon Lee: The glueing number of ordered sets.
• 
  Brett Stevens, Alan C. H. Ling, Eric Mendelsohn: A direct construction of transversal covers using group divisible designs.
• 
  Suh-Ryung Kim, Fred S. Roberts: Competition graphs of semiorders and the conditions C(p) and C*(p).
• 
  Ljiljana Brankovic, Peter Horák, Mirka Miller, Alexander Rosa: Premature partial latin squares.
• 
  Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri: A note on the spatiality degree of graphs.
• 
  Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, Celina M. Herrera de Figueiredo: The splitting number and skewness of C_n x C_m.
• 
  Marisa Gutierrez, João Meidanis: On clique graph recognition.
• 
  Jason I. Brown, Carl A. Hickman: On chromatic roots with negative real part.
• 
  Alan C. H. Ling: Packings with block size five and index one: v \equiv 2 (mod 4).
• 
  Gábor Bacsó, Zsolt Tuza: Structural domination of graphs.
• 
  Yi-Chih Hsieh: De Bruijn sequences: Generation, reproduction and applications.
• 
  Martin Sutton, Anna Draganova, Mirka Miller: Mod sum number of wheels.
• 
  Yoomi Rho: A note on the Alon-Saks-Seymour coloring conjecture.
• 
  Saeed Akbari, Gholamreza B. Khosrovshahi: On the smallest edge defining sets of graphs.
• 
  N. M. Singhi, G. R. Vijayakumar, N. Usha Devi: Set-magic labelings of infinite graphs.
• 
  Kevin Hare: Perfect <k, r>-latin squares.

last updated on Sat May 18 05:48:53 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page