Discrete Mathematics, Volume 207

Volume 207, Numbers 1-3, September 1999

• Armen S. Asratian, Nikolai N. Kuzjurin: On the number of nearly perfect matchings in almost regular uniform hypergraphs. 1-8
• Junliang Cai, Yanpei Liu:
  The enumeration of rooted nonseparable nearly cubic maps. 9-24
  
• Grant Cairns, Deborah M. King:
  The answer to Woodall's musquash problem. 25-32
  
• Hironobu Fujii, Atsushi Katsuda:
  Isospectral graphs and isoperimetric constants. 33-52
  
• Thomas R. Hagedorn:
  On the existence of magic n-dimensional rectangles. 53-63
  
• Thomas R. Hagedorn:
  Magic rectangles revisited. 65-72
  
• Martin Helm:
  On the Beck-Fiala theorem. 73-87
  
• Keith A. Kearnes, Emil W. Kiss:
  Finite algebras of finite complexity. 89-135
  
• Bruce M. Landman:
  On some generalizations of the van der Waerden number w(3). 137-147
  
• Nadimpalli V. R. Mahadev, Tao-Ming Wang:
  On uniquely intersectable graphs. 149-159
  
• Yannis Manoussakis, Ioannis Milis:
  A sufficient condition for maximum cycles in bipartite digraphs. 161-171
  
• Allan D. Mills, James G. Oxley:
  A class of non-binary matroids with many binary minors. 173-187
  
• Wojciech Peisert:
  Direct product and uniqueness of automorphism groups of graphs. 189-197
  
• Norbert Polat:
  Invariant subgraph properties in pseudo-modular graphs. 199-217
  
• H. Pulapaka:
  Nonrevisiting cycles on surfaces. 219-231
  
• Hong Wang:
  Bipartite graphs containing every possible pair of cycles. 233-242
  
• Volkmar Welker:
  Constructions preserving evasiveness and collapsibility. 243-255
  
• Igor E. Zverovich:
  Near-complete multipartite graphs and forbidden induced subgraphs. 257-262
  
• Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Zdenek Ryjácek:
  Induced S(K_{1, 3}) and hamiltonian cycles in the square of a graph. 263-269
  
• David Craft, Esther Hunt Tesar:
  On a question by Erdös about edge-magic graphs. 271-276
  
• Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall:
  Transversals in uniform hypergraphs with property (7, 2). 277-284
  
• Dung Le, Anthony J. Macula:
  On the probability that subset sequences are minimal. 285-289
  
• E. Steffen:
  Counterexamples to a conjecture about Petersen-minors in supersnarks. 291-292
  
• Taro Tokuda:
  Connected [a, b]-factors in K_{1, n}-free graphs containing an [a, b]-factor. 293-298