Discrete Mathematics, Volume 243

Volume 243, Number 1-3, January 2002

• Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian:
  The three-way intersection problem for latin squares. 1-19
  Electronic Edition (link) BibTeX
• Paolo Boldi, Sebastiano Vigna:
  Fibrations of graphs. 21-66
  Electronic Edition (link) BibTeX
• Yair Caro, Raphael Yuster:
  List decomposition of graphs. 67-77
  Electronic Edition (link) BibTeX
• Antonio di Nola, Revaz Grigolia:
  MV-algebras in duality with labelled root systems. 79-90
  Electronic Edition (link) BibTeX
• Jill R. Faudree, Ralph J. Faudree:
  Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian. 91-108
  Electronic Edition (link) BibTeX
• Gennian Ge:
  Resolvable group divisible designs with block size four. 109-119
  Electronic Edition (link) BibTeX
• Frédéric Havet:
  Trees in tournaments. 121-134
  Electronic Edition (link) BibTeX
• Olof Heden:
  Maximal partial spreads and the modular n-queen problem III. 135-150
  Electronic Edition (link) BibTeX
• Mirko Lepovic:
  On formal products and angle matrices of a graph. 151-160
  Electronic Edition (link) BibTeX
• Hung Q. Ngo, Ding-Zhu Du:
  New constructions of non-adaptive and error-tolerance pooling designs. 161-170
  Electronic Edition (link) BibTeX
• Mingquan Zhan:
  Neighborhood intersections and Hamiltonicity in almost claw-free graphs. 171-185
  Electronic Edition (link) BibTeX
• Marcelo Muniz Silva Alves, João Roberto Gerônimo, Reginaldo Palazzo Jr., Sueli I. Rodrigues Costa, J. Carmelo Interlando, Martinho C. Araújo:
  Relating propelinear and binary G-linear codes. 187-194
  Electronic Edition (link) BibTeX
• Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
  Path factors in claw-free graphs. 195-200
  Electronic Edition (link) BibTeX
• Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden:
  Factorizations of and by powers of complete graphs. 201-205
  Electronic Edition (link) BibTeX
• Karen L. Collins:
  On planar and dismantlable lattices. 207-211
  Electronic Edition (link) BibTeX
• Gérard Cornuéjols, Bertrand Guenin:
  On dijoins. 213-216
  Electronic Edition (link) BibTeX
• Feng Ming Dong, Kee L. Teo, Khee Meng Koh:
  A note on the chromaticity of some 2-connected (n, n+3)-graphs. 217-221
  Electronic Edition (link) BibTeX
• Paolo Dulio, Raffaele Scapellato:
  Two discrete?non-discrete results. 223-228
  Electronic Edition (link) BibTeX
• Anthony B. Evans:
  On orthogonal orthomorphisms of cyclic and non-abelian groups. 229-233
  Electronic Edition (link) BibTeX
• Rodney W. Forcade, Jack Lamoreaux:
  Diameter series of lattice covering simplices. 235-239
  Electronic Edition (link) BibTeX
• Wenjie He, Xinkai Yu, Honghai Mi, Yong Xu, Yufa Shen, Lixin Wang:
  The (integral) sum number of K_n?E(K_r). 241-252
  Electronic Edition (link) BibTeX
• Aicke Hinrichs:
  Spherical codes and Borsuk's conjecture. 253-256
  Electronic Edition (link) BibTeX
• Zu Nian Li, Zhen Zhen Feng:
  Counterexamples against some families of chromatically unique graphs. 257-258
  Electronic Edition (link) BibTeX
• Yan Liu, Jianxiu Hao:
  The enumeration of near-perfect matchings of factor-critical graphs. 259-266
  Electronic Edition (link) BibTeX
• Ronald C. Read, Earl Glen Whitehead Jr.:
  The Tutte polynomial for homeomorphism classes of graphs. 267-272
  Electronic Edition (link) BibTeX
• Talmage James Reid, Haidong Wu:
  On elements in small cocircuits in minimally k-connected graphs and matroids. 273-282
  Electronic Edition (link) BibTeX
• Zi-Xia Song:
  A further extension of Yap's construction for ?-critical graphs. 283-290
  Electronic Edition (link) BibTeX
• Jun-Ming Xu, Ke-Li Xu:
  On restricted edge-connectivity of graphs. 291-298
  Electronic Edition (link) BibTeX