Discrete Mathematics, Volume 141

Volume 141, Numbers 1-3, June 1995

• Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman:
  Long cycles in graphs with prescribed toughness and minimum degree. 1-10
  Electronic Edition (link) BibTeX
• Christine Bessenrodt:
  Generalisations of the Andrews-Olsson partition identity and applications. 11-22
  Electronic Edition (link) BibTeX
• John L. Blanchard:
  An extension theorem for Steiner systems. 23-35
  Electronic Edition (link) BibTeX
• Paul A. Catlin, Hong-Jian Lai:
  Vertex arboricity and maximum degree. 37-46
  Electronic Edition (link) BibTeX
• Amanda G. Chetwynd, Susan J. Rhodes:
  Chessboard squares. 47-59
  Electronic Edition (link) BibTeX
• Nam-Po Chiang, Hung-Lin Fu:
  The achromatic indices of the regular complete multipartite graphs. 61-66
  Electronic Edition (link) BibTeX
• Sheshayya A. Choudum, K. Kayathri:
  There are no edge-chromatic 4-critical graphs of order 12. 67-73
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Christina M. Mynhardt:
  A characterisation of universal minimal total dominating functions in trees. 75-84
  Electronic Edition (link) BibTeX
• J. A. Dias da Silva, Amélia Fonseca:
  The r-depth of a matroid. 85-93
  Electronic Edition (link) BibTeX
• Wayne M. Dymàcek, Tom Whaley:
  Generating strings for bipartite Steinhaus graphs. 95-107
  Electronic Edition (link) BibTeX
• Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
  Degree conditions and cycle extendability. 109-122
  Electronic Edition (link) BibTeX
• Miguel Angel Fiol:
  On congruence in Zⁿ and the dimension of a multidimensional circulant. 123-134
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Martin Loebl:
  Complexity of circuit intersection in graphs. 135-151
  Electronic Edition (link) BibTeX
• Gregory Gutin:
  Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. 153-162
  Electronic Edition (link) BibTeX
• Nora Hartsfield, W. F. Smyth:
  A family of sparse graphs of large sum number. 163-171
  Electronic Edition (link) BibTeX
• Anne Joseph:
  The isomorphism problem for Cayley digraphs on groups of prime-squared order. 173-183
  Electronic Edition (link) BibTeX
• Emanuel Knill, Andrzej Ehrenfeucht, David Haussler:
  The size of k-pseudotrees. 185-194
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  A nonorientable triangular embedding of K_n-K₂, n=8 (mod 12). 195-211
  Electronic Edition (link) BibTeX
• Ruqun Shen, Feng Tian:
  Neighborhood unions and hamiltonicity of graphs. 213-225
  Electronic Edition (link) BibTeX
• Jayme Luiz Szwarcfiter:
  On edge transitivity of directed graphs. 227-235
  Electronic Edition (link) BibTeX
• Chi Wang:
  Boolean minors. 237-258
  Electronic Edition (link) BibTeX
• J. F. Weng, R. S. Booth:
  Steiner minimal trees on regular polygons with centre. 259-274
  Electronic Edition (link) BibTeX
• Xiaomin Bao:
  Two new symmetric inseparable double squares. 275-277
  Electronic Edition (link) BibTeX
• Anita C. Burris:
  The irregular coloring number of a tree. 279-283
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton:
  Degree sequence and independence in K(4)-free graphs. 285-290
  Electronic Edition (link) BibTeX
• Cuiqin Lin, Guanzhang Hu, Zhongfu Zhang:
  A six-color theorem for the edge-face coloring of plane graphs. 291-297
  Electronic Edition (link) BibTeX