Discrete Mathematics, Volume 257

Volume 257, Number 1, November 2002

• Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
  A cycle lemma for permutation inversions. 1-13
  
• B. Corbas, Graham D. Williams:
  Congruence classes in M₃(F_q) (q even). 15-27
  
• Charles Delorme, Odile Favaron, Dieter Rautenbach:
  On the Randic Image index. 29-38
  
• J. M. Fish, Regina Klimmek, Karen Seyffarth:
  Line graphs of complete multipartite graphs have small cycle double covers. 39-61
  
• Jian-guo Lei:
  On large sets of disjoint Kirkman triple systems. 63-81
  
• Vadim V. Lozin:
  Bipartite graphs without a skew star. 83-100
  
• J. A. Rodríguez, A. Gutiérrez, José Luis Andres Yebra:
  On spectral bounds for cutsets. 101-109
  
• Laura A. Sanchis:
  On the number of edges in graphs with a given weakly connected domination number. 111-124
  
• José Plínio O. Santos, Andrew V. Sills:
  q-Pell sequences and two identities of V.A. Lebesgue. 125-142
  
• Zhi-Wei Sun:
  Sums of minima and maxima. 143-159
  
• Suohai Fan:
  Retractions of split graphs and End-orthodox split graph. 161-164
  
• Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe:
  On separable self-complementary graphs. 165-168
  
• Lian-ying Miao, Jian-liang Wu:
  Edge-coloring critical graphs with high degree. 169-172
  
• David Reimer:
  The Ramsey size number of dipaths. 173-175
  
• Romeo Rizzi:
  Minimum T-cuts and optimal T-pairings. 177-181
  
• Yasuo Teranishi:
  Laplacian spectra and invariants of graphs. 183-189
  

Volume 257, Number 2-3, November 2002

• Lenore Cowen, Jerrold R. Griggs, Douglas B. West:
  Foreword. 191-192
  
• G. W. Peck:
  Kleitman and Combinatorics: A Celebration. 193-224
  
• Michael E. Saks:
  Kleitman and combinatorics. 225-247
  
• Noga Alon:
  Covering a hypergraph of subgraphs. 249-254
  
• Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman:
  On partitions of discrete boxes. 255-258
  
• Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck:
  On the average size of sets in intersecting Sperner families. 259-266
  
• Alina Beygelzimer, Stanislaw P. Radziszowski:
  On halving line arrangements. 267-283
  
• Sergei L. Bezrukov, Oriol Serra:
  A local-global principle for vertex-isoperimetric problems. 285-309
  
• Graham Brightwell, William T. Trotter:
  A combinatorial approach to correlation inequalities. 311-327
  
• Glenn G. Chappell:
  Polyunsaturated posets and graphs and the Greene-Kleitman theorem. 329-340
  
• Fan R. K. Chung, Robert B. Ellis:
  A chip-firing game and Dirichlet eigenvalues. 341-355
  
• Andrzej Czygrinow, Henry A. Kierstead:
  2-factors in dense bipartite graphs. 357-369
  
• Ding-Zhu Du, D. Frank Hsu, Hung Quang Ngo, G. W. Peck:
  On connectivity of consecutive-d digraphs. 371-384
  
• Zoltán Füredi, András Gyárfás, Miklós Ruszinkó:
  On the maximum size of (p, Q)-free families. 385-403
  
• Wayne Goddard:
  4-connected maximal planar graphs are 4-ordered. 405-410
  
• Jerrold R. Grigg:
  Intersecting families with minimum volume. 411-414
  
• András Gyárfás, André E. Kézdy, Jenö Lehel:
  A finite basis characterization of ?-split colorings. 415-421
  
• Peter Hamburger:
  Doodles and doilies, non-simple symmetric Venn diagram. 423-439
  
• Tao Jiang:
  Planar Hamiltonian chordal graphs are cycle extendable. 441-444
  
• Atsushi Kaneko, Kiyoshi Yoshimoto:
  On a 2-factor with a specified edge in a graph satisfying the Ore condition. 445-461
  
• Aleksey D. Korshunov, Ilya Shmulevich:
  On the distribution of the number of monotone Boolean functions relative to the number of lower units. 463-479
  
• Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson:
  Counting dyadic equipartitions of the unit square. 481-499
  
• Mark J. Logan:
  Sperner theory in a difference of Boolean lattices. 501-512
  
• Dhruv Mubayi, Douglas B. West:
  On restricted edge-colorings of bicliques. 513-529
  
• Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:
  A note on triangle-free and bipartite graphs. 531-540
  
• Leonard J. Schulman:
  A random stacking process. 541-547
  
• Vladimir D. Tonchev:
  Error-correcting codes from graphs. 549-557
  
• Jun Wang:
  Normalized matching property of the subgroup lattice of an abelian p-group. 559-574
  
• Herbert S. Wilf:
  The patterns of permutations. 575-583
  
• Elizabeth L. Wilmer, Michael D. Ernst:
  Graphs induced by Gray codes. 585-598
  
• Research problems. 599-624