Discrete Mathematics, Volume 114

Volume 114, Numbers 1-3, April 1993

• Preface. 1-2
  
• Noga Alon, Yair Caro, Ilia Krasikov:
  Bisection of trees and sequences. 3-7
  
• D. Amar:
  Irregularity strength of regular graphs of large degree. 9-17
  
• Krystyna T. Balinska, Louis V. Quintas:
  The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. 19-22
  
• Alexander Belfer, Martin Charles Golumbic:
  Counting endpoint sequences for interval orders and interval graphs. 23-39
  
• S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides:
  Grid intersection graphs and boxicity. 41-49
  
• Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat:
  Connectivity of kautz networks. 51-62
  
• J. Bond, C. Delorme:
  A note on partial Cayley graphs. 63-74
  
• André Bouchet:
  Recognizing locally equivalent graphs. 75-86
  
• Mark Chaimovich:
  Fast exact and approximate algorithms for k-partition and scheduling independent tasks. 87-103
  
• Gérard D. Cohen, Gilles Zémor:
  Write-isolated memories (WIMs). 105-113
  
• Charles J. Colbourn, Ehab S. Elmallah:
  Reliable assignments of processors to tasks and factoring on matroids. 115-129
  
• Italo J. Dejter, Walter Cedeño, V. Jauregui:
  A note on frucht diagrams, boolean graphs and hamilton cycles. 131-135
  
• C. Delorme:
  Eigenvalues of finite graphs. 137-146
  
• Pilar Esqué, F. Aguiló, Miguel Angel Fiol:
  Double commutative-step digraphs with minimum diameters. 147-157
  
• Philippe Flajolet, Michèle Soria:
  General combinatorial schemas: Gaussian limit distributions and exponential tails. 159-180
  
• Jean-Luc Fouquet, Henri Thuillier:
  Decomposition of 3-connected cubic graphs. 181-198
  
• F. Franek, Vojtech Rödl:
  2-Colorings of complete graphs with a small number of monochromatic K₄ subgraphs. 199-203
  
• Gregory Freiman:
  New analytical results in subset-sum problem. 205-217
  
• J. Gómez, Miguel Angel Fiol, Oriol Serra:
  On large (Delta, D)-graphs. 219-235
  
• Tayuan Huang, Monique Laurent:
  (s, r; mu)-nets and alternating forms graphs. 237-252
  
• François Jaeger:
  Plane graphs and link invariants. 253-264
  
• Leif K. Jørgensen:
  Nonexistence of certain cubic graphs with small diameters. 265-273
  
• Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson:
  Combinatorial characterization of read-once formulae. 275-282
  
• Carole S. Klein, Steven Minsker:
  The super towers of Hanoi problem: large rings on small rings. 283-295
  
• Natalia Kogan, Abraham Berman:
  Characterization of completely positive graphs. 297-304
  
• Ephraim Korach, Zvi Ostfeld:
  Recognition of DFS trees: sequential and parallel algorithms with refined verifications. 305-327
  
• Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars:
  Maintenance of 2- and 3-edge- connected components of graphs I. 329-359
  
• Rafi Levy, Eli Shamir:
  A note on a counting problem arising in percolation theory. 361-365
  
• E. Lipkin:
  On subset sums of r-sets. 367-377
  
• Maurice Nivat, Andreas Podelski:
  Another variation on the common subexpression problem. 379-401
  
• Uri N. Peled, Murali K. Srinivasan:
  Poset matching - a distributive analog of independent matching. 403-424
  
• Miklos Santha, Umesh V. Vazirani:
  Parallel searching of multidimensional cubes. 425-433
  
• Ron Shamir:
  A fast algorithm for constructing monge sequences in transportation problems with forbidden arcs. 435-444