Discrete Mathematics, Volume 150

Volume 150, Numbers 1-3, April 1996

• András Hajnal, Gyula O. H. Katona, Attila Sali:
  Preface. 1
  
• Jaromir Abrham, Anton Kotzig:
  Graceful valuations of 2-regular graphs with two components. 3-15
  
• Krystyna T. Balinska, Louis V. Quintas:
  Degrees in a digraph whose nodes are graphs. 17-29
  
• Curtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza:
  Cycle-saturated graphs of minimum size. 31-48
  
• Arie Bialostocki, Hanno Lefmann, Terry Meerdink:
  On the degree of regularity of some equations. 49-60
  
• Miklós Bóna, Géza Tóth:
  A Ramsey-type problem on right-angled triangles in space. 61-67
  
• Myung S. Chung, Douglas B. West:
  Large 2P₃-free graphs with bounded degree. 69-79
  
• György Csizmadia:
  Furthest neighbours in space. 81-88
  
• Paul Erdös, Tibor Gallai, Zsolt Tuza:
  Covering and independence in triangle structures. 89-101
  
• Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
  Graph spectra. 103-113
  
• Odile Favaron:
  Least domination in a graph. 115-122
  
• Alfred Geroldinger, Rudolf Schneider:
  The cross number of finite abelian groups III. 123-130
  
• Ivan Gutman, Aleksandar Ivic:
  On Matula numbers. 131-142
  
• Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther:
  5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. 143-153
  
• Penny E. Haxell:
  Atoms of set systems with a fixed number of pairwise unions. 155-166
  
• Wilfried Imrich, Janez Zerovnik:
  On the weak reconstruction of Cartesian-product graphs. 167-178
  
• Stanislav Jendrol, Michal Tkác, Zsolt Tuza:
  The irregularity strength and cost of the union of cliques. 179-186
  
• Hal A. Kierstead, Vojtech Rödl:
  Applications of hypergraph coloring to coloring graphs not inducing certain trees. 187-193
  
• Martin Klazar:
  Extremal functions for sequences. 195-203
  
• Katalin Kolossa:
  On the on-line chromatic number of the family of on-line 3-chromatic graphs. 205-230
  
• Dieter Kratsch, Jenö Lehel, Haiko Müller:
  Toughness, hamiltonicity and split graphs. 231-245
  
• Marek Kubale, Konrad Piwakowski:
  A linear time algorithm for edge coloring of binomial trees. 247-256
  
• Monique Laurent:
  Hilbert bases of cuts. 257-279
  
• Tamás Lengyel:
  On some properties of the series Sum_k=0^infinity kⁿx^k and the Stirling numbers of the second kind. 281-292
  
• Rafaï Mourad Madani:
  Characterization of Laborde-Mulder graphs (extended odd graphs). 293-301
  
• Snezana Matic-Kekic, Dragan M. Acketa, Jovisa D. Zunic:
  An exact construction of digital convex polygons with minimal diameter. 303-313
  
• Michael D. Plummer:
  Extending matchings in planar graphs V. 315-324
  
• Norbert Polat:
  Stable graphs for a family of endomorphisms. 325-335
  
• Dragos Radu Popescu:
  Une méthode d'énumération des cycles négatifs d'un graphe signé. 337-345
  
• Marek Raczunas, Piotr Chrzastowski-Wachtel:
  A Diophantine problem of Frobenius in terms of the least common multiple. 347-357
  
• Jean-François Saclé:
  Lower bounds for the size in four families of minimum broadcast graphs. 359-369
  
• Shin-ichi Tokunaga:
  On a straight-line embedding problem of graphs. 371-378
  
• Katalin Vesztergombi:
  The two largest distances in finite planar sets. 379-386
  
• Hansjoachim Walther:
  A nonhamiltonian five-regular multitriangular polyhedral graph. 387-392