Discrete Mathematics, Volume 127

Volume 127, Numbers 1-3, March 1994

• Preface. 1
  Electronic Edition (link) BibTeX
• Gakuho Abe:
  Unsolved problems on magic squares. 3-13
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Debra L. Boutin:
  Lower bounds for constant degree independent sets. 15-21
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Derek A. Holton, Zang Ke Min:
  A degree characterisation of pancyclicity. 23-29
  Electronic Edition (link) BibTeX
• Noga Alon:
  Probabilistic methods in coloring and decomposition problems. 31-46
  Electronic Edition (link) BibTeX
• Mehdi Behzad, Ebadollah S. Mahmoodian:
  Eccentric sequences and triangle sequences of block designs. 47-56
  Electronic Edition (link) BibTeX
• Jose M. Bernaldez:
  On cyclically K-complementary graphs. 57-62
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  Two-graphs and trees. 63-74
  Electronic Edition (link) BibTeX
• Luis D. Carrillo:
  Hamiltonian-connected self-complementary graphs. 75-93
  Electronic Edition (link) BibTeX
• David P. Day, Ortrud R. Oellermann, Henda C. Swart:
  On the l-connectivity of a diagraph. 95-104
  Electronic Edition (link) BibTeX
• Caterina De Simone, Michel Deza, Monique Laurent:
  Collapsing and lifting for the cut cone. 105-130
  Electronic Edition (link) BibTeX
• Chai-Ling Deng, Chong-Keang Lim:
  A class of clique-closed graphs. 131-137
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
  Extremal problems and generalized degrees. 139-152
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  A local density condition for triangles. 153-161
  Electronic Edition (link) BibTeX
• Josep Fàbrega, Miguel Angel Fiol:
  Extraconnectivity of graphs with large girth. 163-170
  Electronic Edition (link) BibTeX
• I. A. Faradzev:
  Association schemes on the set of antiflags of a projective plane. 171-179
  Electronic Edition (link) BibTeX
• Hung-Lin Fu, Kuo-Ching Huang:
  On prime labellings. 181-186
  Electronic Edition (link) BibTeX
• Zoltán Füredi:
  Intersecting designs from linear programming and graphs of diameter two. 187-207
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs, Daniel J. Kleitman:
  Independence and the Havel-Hakimi residue. 209-212
  Electronic Edition (link) BibTeX
• Pavol Hell, Xingxing Yu, Huishan Zhou:
  Independence ratios of graph powers. 213-220
  Electronic Edition (link) BibTeX
• A. V. Ivanov:
  Two families of strongly regular graphs with the 4-vertex condition. 221-242
  Electronic Edition (link) BibTeX
• K. M. Koh, K. L. Teo:
  Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. 243-258
  Electronic Edition (link) BibTeX
• K. Nomura:
  An application of intersection diagrams of high rank. 259-264
  Electronic Edition (link) BibTeX
• B. L. Piazza, Richard D. Ringeisen, S. Stueckle:
  Subthrackleable graphs and four cycles. 265-276
  Electronic Edition (link) BibTeX
• Michael D. Plummer:
  Extending matchings in graphs: A survey. 277-292
  Electronic Edition (link) BibTeX
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani:
  Minimal acyclic forbidden minors for the family of graphs with bounded path-width. 293-304
  Electronic Edition (link) BibTeX
• Morimasa Tsuchiya:
  On antichain intersection numbers, total clique covers and regular graphs. 305-318
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Largest size and union of Helly families. 319-327
  Electronic Edition (link) BibTeX