Discrete Mathematics, Volume 211

Volume 211, Issues 1-3, January 2000

• Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus:
  Restrained domination in trees. 1-9
  
• Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus:
  alpha-Domination. 11-26
  
• Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein:
  Equational characterizations of Boolean function classes. 27-51
  
• C. Grant, Christopher A. Rodger:
  An n to 2n embedding of incomplete idempotent latin squares for small values ofn. 53-74
  
• Khee Meng Koh, Eng Guan Tay:
  On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. 75-102
  
• Germain Kreweras, Dominique Dumont:
  Sur les anagrammes alternés. 103-110
  
• Gangsong Leng, Yao Zhang, Bolin Ma:
  Largest parallelotopes contained in simplices. 111-123
  
• Michael E. Mays, Jerzy Wojciechowski:
  A determinant property of Catalan numbers. 125-133
  
• Miwako Mishima, Masakazu Jimbo:
  Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs. 135-152
  
• Norbert Polat:
  On infinite bridged graphs and strongly dismantlable graphs. 153-166
  
• Jian Shen:
  On the girth of digraphs. 167-181
  
• Adrian Dumitrescu, William L. Steiger:
  On a matching problem in the plane. 183-195
  
• Claude Berge, Bruce A. Reed:
  Optimal packings of edge-disjoint odd cycles. 197-202
  
• Josep M. Brunat, Montserrat Maureso:
  Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups. 203-208
  
• Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt:
  Nordhaus-Gaddum results for CO-irredundance in graphs. 209-215
  
• Peter Dankelmann, Lutz Volkmann:
  Degree sequence conditions for maximally edge-connected graphs depending on the clique number. 217-223
  
• Michael D. Hirschhorn:
  Some formulae for partitions into squares. 225-228
  
• Yuan Hong, Jin-Long Shu:
  A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type. 229-232
  
• Brad Jackson, Gerhard Ringel:
  Variations on Ringel's earth-moon problem. 233-242
  
• Jaroslav Jezek, Petar Markovic, Miklós Maróti, Ralph McKenzie:
  Equations of tournaments are not finitely based. 243-248
  
• Robert Johansson:
  Triangle-factors in a balanced blown-up triangle. 249-254
  
• Henry A. Kierstead:
  On the choosability of complete multipartite graphs with part size three. 255-259
  
• Alon Nilli:
  Triangle-free graphs with large chromatic numbers. 261-262
  
• Yoomi Rho:
  An extremal problem concerning graphs not containing K_t and K_{t, t}. 263-268
  
• Uwe Schnell:
  FCC versus HCP via parametric density. 269-274
  
• Jorge Jiménez Urroz:
  Congruences for the partition function in certain arithmetic progressions. 275-280
  
• Kazuhiko Ushio:
  S_k-factorization of symmetric complete tripartite digraphs. 281-286
  
• Yuansheng Yang, Jianhua Lin, Chunli Wang, Kaifeng Li:
  On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. 287-298