Discrete Mathematics, Volume 89

Volume 89, Number 1, May 1991

• Arkady A. Chernyak, Zhanna A. Chernyak:
  Split dimension of graphs. 1-6
  
• B. Courteau, André Montpetit:
  Dual distances of completely regular codes. 7-15
  
• Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza:
  Decompositions of regular bipartite graphs. 17-27
  
• Michel Mollard:
  Cycle-regular graphs. 29-41
  
• Elena Stöhr:
  The pagewidth of trivalent planar graphs. 43-49
  
• Feng Tian, Wenan Zang:
  The maximum number of diagonals of a cycle in a block and its extremal graphs. 51-63
  
• Shaoji Xu:
  Relations between parameters of a graph. 65-88
  
• Siming Zhan:
  On hamiltonian line graphs and connectivity. 89-95
  
• Michael O. Albertson, David M. Berman:
  The number of cut-vertices in a graph of given minimum degree. 97-100
  
• Peter Damaschke:
  Irredundance number versus domination number. 101-104
  
• Egbert Harzheim:
  Weakly arithmetic progressions in sets of natural numbers. 105-107
  

Volume 89, Number 2, May 1991

• Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa:
  Pancyclism in hamiltonian graphs. 111-131
  
• Roy D. Bryant, Harold Fredricksen: Covering the de Bruijn graph. 133-148
• Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa:
  Partitioning Steiner triple systems into complete arcs. 149-160
  
• Raul Cordovil, Komei Fukuda, Maria Leonor Moreira:
  Clutters and matroids. 161-171
  
• Hanno Lefmann:
  Non t-intersecting families of linear spaces over GF(q). 173-183
  
• Patrick Solé:
  On the parameters of codes for the Lee and modular distance. 185-194
  
• Ahmed Ainouche:
  Four sufficient conditions for hamiltonian graphs. 195-200
  
• Gerhard Behrendt:
  The lattice of antichain cutsets of a partially ordered set. 201-202
  
• E. J. Farrell, J. M. Guo, G. M. Constantine:
  On matching coefficients. 203-210
  
• Danut Marcu:
  The powers of two and three. 211-212
  
• Antonino Giorgio Spera:
  (s, k, lambda)-Partitions of a vector space. 213-217
  

Volume 89, Number 3, June 1991

• Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps:
  Blocking sets in designs with block size four II. 221-229
  
• Esther R. Lamken:
  The existence of 3 orthogonal partitioned incomplete Latin squares of type tⁿ. 231-251
  
• Terry A. McKee:
  Intersection properties of graphs. 253-260
  
• R. Bruce Richter:
  Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces. 261-268
  
• Norbert Seifter:
  Groups acting on graphs with polynomial growth. 269-280
  
• Saul Stahl:
  Region distributions of some small diameter graphs. 281-299
  
• Geoffrey Exoo:
  Three color Ramsey number of K₄-e. 301-305
  
• Hadi Kharaghani:
  An infinite class of Hadamard matrices of maximal excess. 307-312
  
• Micha Sharir, Steven Skiena:
  Tight bounds on a problem of lines and intersections. 313-314
  
• Edita Sinajová:
  A note on vector representation of graphs. 315-317
  
• Chengde Xu:
  A necessary and sufficient condition for a graph G with diameter 5 to be 2-diameter-stable. 319-324
  
• To: J.M. van den Akker, J.H. Koolen and R.J.M. Vaessens, "Perfect codes with distinct protective radii", Discrete Mathematics 81 (1990) 103-109. 325
  

Last update Thu May 23 18:41:13 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page