Discrete Mathematics, Volume 169

Volume 169, Numbers 1-3, May 1997

• Mao-cheng Cai:
  Connected [k, k + 1]-factors of graphs. 1-16
  Electronic Edition (link) BibTeX
• G. F. Clements:
  The cubical poset is additive. 17-28
  Electronic Edition (link) BibTeX
• Karen L. Collins, Lucia B. Krompart:
  The number of Hamiltonian paths in a rectangular grid. 29-38
  Electronic Edition (link) BibTeX
• Feng Ming Dong, Khee Meng Koh:
  On graphs in which any pair of colour classes but one induces a tree. 39-54
  Electronic Edition (link) BibTeX
• Tuvi Etzion:
  Optimal constant weight codes over Z_k and generalized designs. 55-82
  Electronic Edition (link) BibTeX
• Jerrold W. Grossman:
  Dominating sets whose closed stars form spanning trees. 83-94
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  A tighter bounding interval for the 1-chromatic number of a surface. 95-120
  Electronic Edition (link) BibTeX
• David Kuo, Gerard J. Chang, Y. H. Harris Kwong:
  Cordial labeling of mK_n. 121-131
  Electronic Edition (link) BibTeX
• Xin Liu:
  Lower bounds of length of longest cycles in graphs involving neighborhood unions. 133-144
  Electronic Edition (link) BibTeX
• Sergey Vasil'evich Sevast'janov, Wojciech Banaszczyk:
  To the Steinitz lemma in coordinate form. 145-152
  Electronic Edition (link) BibTeX
• Andries E. Brouwer, H. M. Mulder:
  The vertex connectivity of a {0, 2}-graph equals its degree. 153-155
  Electronic Edition (link) BibTeX
• Aaron Abrams:
  The kth upper chromatic number of the line. 157-162
  Electronic Edition (link) BibTeX
• Dragic Bankovic:
  General reproductive solutions of Postian equations. 163-168
  Electronic Edition (link) BibTeX
• C. Berge, Jean-Luc Fouquet:
  On the optimal transversals of the odd cycles. 169-175
  Electronic Edition (link) BibTeX
• Oleg V. Borodin:
  A new proof of Grünbaum's 3 color theorem. 177-183
  Electronic Edition (link) BibTeX
• Iliya Boukliev:
  New bounds for the minimum length of quaternary linear codes of dimension five. 185-192
  Electronic Edition (link) BibTeX
• Gunnar Brinkmann, Eckhard Steffen:
  3- and 4-critical graphs of small even order. 193-197
  Electronic Edition (link) BibTeX
• Richard A. Brualdi, J. A. Dias da Silva:
  A retract characterization of posets with the fixed-point property. 199-203
  Electronic Edition (link) BibTeX
• Kathie Cameron:
  Coloured matchings in bipartite graphs. 205-209
  Electronic Edition (link) BibTeX
• Beifang Chen:
  Parametric Möbius inversion formulas. 211-215
  Electronic Edition (link) BibTeX
• D. de Caen:
  A lower bound on the probability of a union. 217-220
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez:
  A characterization of normal fraternally orientable perfect graphs. 221-225
  Electronic Edition (link) BibTeX
• Xavier Gourdon, Helmut Prodinger:
  A generating function approach to random subgraphs of the n-cycle. 227-232
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs, Yan-Chyuan Lin:
  The maximum sum of degrees above a threshold in planar graphs. 233-243
  Electronic Edition (link) BibTeX
• Vladimir Gurvich, Leonid Khachiyan:
  On the frequency of the most frequently occurring variable in dual monotone DNFs. 245-248
  Electronic Edition (link) BibTeX
• X. Liu, B. Wei:
  A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs. 249-255
  Electronic Edition (link) BibTeX
• Anthony J. Macula:
  Two applications of separating systems to nonadaptive procedures. 257-262
  Electronic Edition (link) BibTeX
• Ken Ono:
  Odd values of the partition function. 263-268
  Electronic Edition (link) BibTeX
• Søren Riis:
  Bootstrapping the primitive recursive functions by only 27 colors. 269-272
  Electronic Edition (link) BibTeX
• Ladislav Stacho:
  A sufficient condition guaranteeing large cycles in graphs. 273-277
  Electronic Edition (link) BibTeX
• Xueqing Tang, Adi Ben-Israel:
  Two consequences of Minkowski's 2ⁿ theorem. 279-282
  Electronic Edition (link) BibTeX
• Ioan Tomescu:
  On the number of trees having k edges in common with a graph of bounded degrees. 283-286
  Electronic Edition (link) BibTeX
• Bridget S. Webb:
  Orbits of infinite block designs. 287-292
  Electronic Edition (link) BibTeX
• Xue-rong Yong, Talip Acenjian:
  The numbers of spanning trees of the cubic cycle C_N³ and the quadruple cycle C_N⁴. 293-298
  Electronic Edition (link) BibTeX