Discrete Mathematics, Volume 112

Volume 112, Numbers 1-3, March 1993

• Joel Berman, Emil W. Kiss, Péter Pröhle, Ágnes Szendrei:
  The set of types of a finitely generated variety. 1-20
  Electronic Edition (link) BibTeX
• Chong-Yun Chao, Zhibo Chen:
  On uniquely 3-colorable graphs. 21-27
  Electronic Edition (link) BibTeX
• Ciping Chen, Jianfang Wang:
  Factors in graphs with odd-cycle property. 29-40
  Electronic Edition (link) BibTeX
• Marston Conder:
  Generating the Mathieu groups and associated Steiner systems. 41-47
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Paths in interval graphs and circular arc graphs. 49-64
  Electronic Edition (link) BibTeX
• Marie-Pierre Delest, Jean-Marc Fedou:
  Enumeration of skew Ferrers diagrams. 65-79
  Electronic Edition (link) BibTeX
• Guoli Ding:
  Disjoint circuits on a Klein bottle and a theorem on posets. 81-91
  Electronic Edition (link) BibTeX
• Shuhong Gao, Wan-Di Wei:
  On non-Abelian group difference sets. 93-102
  Electronic Edition (link) BibTeX
• Arnold Knopfmacher, John Knopfmacher:
  Counting irreducible factors of polynomials over a finite field. 103-118
  Electronic Edition (link) BibTeX
• Leonid Libkin:
  Direct product decompositions of lattices, closures and relation schemes. 119-138
  Electronic Edition (link) BibTeX
• Dingjun Lou, Derek A. Holton:
  Lower bound of cyclic edge connectivity for n-extendability of regular graphs. 139-150
  Electronic Edition (link) BibTeX
• Tomasz Luczak:
  The size of the largest hole in a random graph. 151-163
  Electronic Edition (link) BibTeX
• Kevin T. Phelps, Christopher A. Rodger:
  Nesting partial Steiner triple systems with 2-regular leave graphs. 165-172
  Electronic Edition (link) BibTeX
• A. G. Robinson, A. J. Goldman:
  The isolation game for regular graphs. 173-184
  Electronic Edition (link) BibTeX
• J. Rodriguez, A. Satyanarayana:
  A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability. 185-197
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Multipartite Turán problem for connected graphs and hypergraphs. 199-206
  Electronic Edition (link) BibTeX
• Marcel Wild:
  Cover preserving embedding of modular lattices into partition lattices. 207-244
  Electronic Edition (link) BibTeX
• Hervé Chabanne, Nicolas Sendrier:
  On the concatenated structures of a [49, 18, 12] binary abelian code. 245-248
  Electronic Edition (link) BibTeX
• Bradley W. Brock:
  A new construction of circulant GH(p²;Z_p). 249-252
  Electronic Edition (link) BibTeX
• Guantao Chen:
  Hamiltonian graphs involving neighborhood intersections. 253-257
  Electronic Edition (link) BibTeX
• Peter Dolan, Mark D. Halsey:
  Random edge domination. 259-260
  Electronic Edition (link) BibTeX
• Guo-Gang Gao:
  On consecutive numbers of the same height in the Collatz problem. 261-267
  Electronic Edition (link) BibTeX
• Zsolt Lengvárszky:
  Distributive sublattices and weakly independent subsets in modular lattices. 269-273
  Electronic Edition (link) BibTeX
• Frédéric Maffray:
  Antitwins in partitionable graphs. 275-278
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  7-critical graphs of bounded genus. 279-281
  Electronic Edition (link) BibTeX
• Raffaele Scapellato:
  A characterization of bipartite graphs associated with BIB-designs with lambda = 1. 283-287
  Electronic Edition (link) BibTeX
• S. Sridharan:
  On the Berge's strong path partition conjecture. 289-293
  Electronic Edition (link) BibTeX
• Huishan Zhou:
  Inequalities with respect to graph homomorphism. 295-298
  Electronic Edition (link) BibTeX