Discrete Mathematics, Volume 154

Volume 154, Numbers 1-3, June 1996

• Mireille Bousquet-Mélou:
  A method for the enumeration of various classes of column-convex polygons. 1-25
  Electronic Edition (link) BibTeX
• Jason I. Brown, Stephen Watson:
  The number of complements of a topology on n points is at least 2ⁿ (except for some special cases). 27-39
  Electronic Edition (link) BibTeX
• K. H. Chew:
  Total chromatic number of regular graphs of odd order and high degree. 41-51
  Electronic Edition (link) BibTeX
• Peter J. Grabner, Robert F. Tichy, Uwe T. Zimmermann: Inequalities for the gamma function with applications to permanents. 53-62 BibTeX
• Andreas J. Guelzow:
  Representation of finite nilpotent squags. 63-76
  Electronic Edition (link) BibTeX
• Pavol Gvozdjak, Jaroslav Nesetril:
  High girth and extendability. 77-84
  Electronic Edition (link) BibTeX
• Jo Heath, Anthony J. W. Hilton:
  At most k-to-1 mappings between graphs, II. 85-102
  Electronic Edition (link) BibTeX
• W. Cary Huffman:
  The equivalence of two cyclic objects on pq elements. 103-127
  Electronic Edition (link) BibTeX
• Klaus Jansen:
  A rainbow about T-colorings for complete graphs. 129-139
  Electronic Edition (link) BibTeX
• Devadatta M. Kulkarni:
  Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal. 141-151
  Electronic Edition (link) BibTeX
• Taojun Lu:
  The enumeration of trees with and without given limbs. 153-165
  Electronic Edition (link) BibTeX
• Peter Maschlanka, Lutz Volkmann:
  Independence number in n-extendable graphs. 167-178
  Electronic Edition (link) BibTeX
• Sean McGuinness:
  On bounding the chromatic number of L-graphs. 179-187
  Electronic Edition (link) BibTeX
• Fred R. McMorris, Henry Martyn Mulder:
  Subpath acyclic digraphs. 189-201
  Electronic Edition (link) BibTeX
• Daniel Q. Naiman, Henry P. Wynn:
  Independence number and the complexity of families of sets. 203-216
  Electronic Edition (link) BibTeX
• John L. Pfaltz:
  Closure lattices. 217-236
  Electronic Edition (link) BibTeX
• Ngo Dac Tan:
  Cubic (m, n)-metacirculant graphs which are not Cayley graphs. 237-244
  Electronic Edition (link) BibTeX
• Cun-Quan Zhang:
  Nowhere-zero 4-flows and cycle double covers. 245-253
  Electronic Edition (link) BibTeX
• J. Orestes Cerdeira, Paulo Bárcia:
  Ordered matroids and regular independence systems. 255-261
  Electronic Edition (link) BibTeX
• Paul Erdös, András Gyárfás, Tomasz Luczak:
  Graphs in which each C₄ spans K₄. 263-268
  Electronic Edition (link) BibTeX
• Frank Gerth:
  Some probabilities for eigenvalues of matrices with entries in finite fields. 269-275
  Electronic Edition (link) BibTeX
• Stefan Hougardy:
  Even pairs and the strong perfect graph conjecture. 277-278
  Electronic Edition (link) BibTeX
• Henry Jacob, Henry Meyniel:
  About quasi-kernels in a digraph. 279-280
  Electronic Edition (link) BibTeX
• K. M. Koh, B. P. Tan:
  Number of 4-kings in bipartite tournaments with no 3-kings. 281-287
  Electronic Edition (link) BibTeX
• K. M. Koh, C. P. Teo:
  Chromaticity of series-parallel graphs. 289-295
  Electronic Edition (link) BibTeX
• Xueliang Li, Heping Zhang:
  A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. 297-300
  Electronic Edition (link) BibTeX
• N. Macris, J. V. Pulé:
  An alternative formula for the number of Euler trails for a class of digraphs. 301-305
  Electronic Edition (link) BibTeX
• Roy Meshulam:
  On products of projections. 307-310
  Electronic Edition (link) BibTeX
• Hans Jürgen Prömel, Angelika Steger:
  Counting H-free graphs. 311-315
  Electronic Edition (link) BibTeX
• U. Schulte:
  Constructing trees in bipartite graphs. 317-320
  Electronic Edition (link) BibTeX
• Michal Tkác:
  On the shortness exponent of 1-tough, maximal planar graphs. 321-328
  Electronic Edition (link) BibTeX