Discrete Mathematics, Volume 156

Volume 156, Numbers 1-3, September 1996

• Stephen J. Curran, Joseph A. Gallian:
  Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. 1-18
  Electronic Edition (link) BibTeX
• R. Balakrishnan, R. Sampathkumar:
  Decompositions of regular graphs into K_n^c v 2K₂. 19-28
  Electronic Edition (link) BibTeX
• M. Bauer, C. Itzykson:
  Triangulations. 29-81
  Electronic Edition (link) BibTeX
• Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross:
  A tight lower bound on the maximum genus of a simplicial graph. 83-102
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez:
  On monochromatic paths and monochromatic cycles in edge coloured tournaments. 103-112
  Electronic Edition (link) BibTeX
• David W. Krumme:
  Reordered gossip schemes. 113-140
  Electronic Edition (link) BibTeX
• Jin Ho Kwak, Se-Goo Kim, Jaeun Lee:
  Distributions of regular branched prime-fold coverings of surfaces. 141-170
  Electronic Edition (link) BibTeX
• MingChu Li:
  Hamiltonian cycles in regular 3-connected claw-free graphs. 171-196
  Electronic Edition (link) BibTeX
• Valery A. Liskovets:
  A reductive technique for enumerating non-isomorphic planar maps. 197-217
  Electronic Edition (link) BibTeX
• Ioan Tomescu:
  An asymptotic formula for the number of graphs having small diameter. 219-228
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  On the bounds for the ultimate independence ratio of a graph. 229-236
  Electronic Edition (link) BibTeX
• J. H. E. Cohn:
  Complex D-optimal designs. 237-241
  Electronic Edition (link) BibTeX
• Sandi Klavzar, Blaz Zmazek:
  On a Vizing-like conjecture for direct product graphs. 243-246
  Electronic Edition (link) BibTeX
• Winston Yang:
  Bell numbers and k-trees. 247-252
  Electronic Edition (link) BibTeX
• Richard P. Anstee, Jerrold R. Griggs:
  An application of matching theory of edge-colourings. 253-256
  Electronic Edition (link) BibTeX
• Béla Bollobás:
  Turán-Ramsey problems. 257-262
  Electronic Edition (link) BibTeX
• Keith Edwards:
  On a problem concerning piles of counters. 263-264
  Electronic Edition (link) BibTeX
• Henry Jacob:
  Kernels in graphs with a clique-cutset. 265-267
  Electronic Edition (link) BibTeX
• Donald L. Kreher, Gordon F. Royle, W. D. Wallis:
  A family of resolvable regular graph designs. 269-275
  Electronic Edition (link) BibTeX
• Vaktang Lashkia, Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg:
  Semirigid sets of diamond orders. 277-283
  Electronic Edition (link) BibTeX
• Miwako Mishima, Masakazu Jimbo:
  A series of identities for the coefficients of inverse matrices on a Hamming scheme. 285-290
  Electronic Edition (link) BibTeX
• Haiko Müller:
  Hamiltonian circuits in chordal bipartite graphs. 291-298
  Electronic Edition (link) BibTeX
• Elefterie Olaru:
  The structure of imperfect critically strongly-imperfect graphs. 299-302
  Electronic Edition (link) BibTeX
• James A. Sellers:
  Recurrences for 2-colored and 3-colored F-partitions. 303-310
  Electronic Edition (link) BibTeX
• Manfred Stern:
  On the covering graph of balanced lattices. 311-316
  Electronic Edition (link) BibTeX
• Xuebin Zhang:
  Construction for indecomposable simple (v, k, lambda)-BIBDs. 317-322
  Electronic Edition (link) BibTeX