Discrete Mathematics, Volume 147

Volume 147, Numbers 1-3, December 1995

• K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, Alexander Pott:
  Relative difference sets with n = 2. 1-17
  
• Francisco Barahona, Ali Ridha Mahjoub:
  On two-connected subgraph polytopes. 19-34
  
• Tony L. Brewster, Michael J. Dinneen, Vance Faber:
  A computational attack on the conjectures of Graffiti: New counterexamples and proofs. 35-55
  
• Richard A. Brualdi, Janine Smolin Graves, K. Mark Lawrence:
  Codes with a poset metric. 57-72
  
• Gary Chartrand, Heather Gavlas, Michelle Schultz:
  Convergent sequences of iterated H-line graphs. 73-86
  
• Edward Dobson:
  Isomorphism problem for Cayley graphs of Z_p³. 87-94
  
• Paul H. Edelman:
  Lexicographically first reduced words. 95-106
  
• Alexander V. Evako:
  Topological properties of the intersection graph of covers of n-dimensional surfaces. 107-120
  
• Susanna Fishel:
  Nonnegativity results for generalized q-binomial coefficients. 121-137
  
• Lorenz Halbeisen, Norbert Hungerbühler:
  The general counterfeit coin problem. 139-150
  
• David Hartvigsen:
  Generalizing the all-pairs min cut problem. 151-169
  
• K. M. Koh, B. P. Tan:
  Kings in multipartite tournaments. 171-183
  
• K. B. Reid, Weizhen Gu:
  Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions. 185-196
  
• Frank Rhodes:
  Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics. 197-209
  
• Petr Savický:
  Bent functions and random boolean formulas. 211-234
  
• Malay K. Sen, B. K. Sanyal, Douglas B. West:
  Representing digraphs using intervals or circular arcs. 235-245
  
• E. C. Sewell, L. E. Trotter:
  Stability critical graphs and ranks facets of the stable set polytope. 247-255
  
• Weifan Wang:
  On the colorings of outerplanar graphs. 257-269
  
• Qingchuan Zhu:
  The largest transversal numbers of uniform hypergraphs. 271-282
  
• Manoj K. Chari:
  Matroid inequalities. 283-286
  
• Virgil Domocos, S. N. Buzeteanu:
  The generating function of irreducible coverings by edges of complete k-partite graphs. 287-292
  
• Ronald D. Dutton, Robert C. Brigham:
  On the radius and diameter of the clique graph. 293-295
  
• Gary Gordon, Eleanor McDonnell:
  Trees with the same degree sequence and path numbers. 297-300
  
• Jochen Harant, Peter J. Owens:
  Non-hamiltonian 4/5-tough maximal planar graphs. 301-305
  
• K. Nomura:
  A remark on Mulder's conjecture about interval-regular graphs. 307-311
  
• Gábor Révész, Jenö Szigeti:
  Eulerian trace identities. 313-319
  
• Jinjiang Yuan:
  A local reductive elimination for the fill-in of graphs. 321-327