Discrete Mathematics, Volume 270

Volume 270, Number 1-3, August 2003

• To the Readers and... . 1- BibTeX
• Terry A. McKee:
  Subgraph trees in graph theory. 3-12
  Electronic Edition (link) BibTeX
• Martin Bokler:
  Lower bounds for the cardinality of minimal blocking sets in projective spaces. 13-31
  Electronic Edition (link) BibTeX
• Anthony Bonato:
  Homomorphisms and amalgamation. 32-41
  Electronic Edition (link) BibTeX
• Alexis Bonnecaze, YoungJu Choie, Steven T. Dougherty, Patrick Solé:
  Splitting the shadow. 42-59
  Electronic Edition (link) BibTeX
• Marc Chastand, Norbert Polat:
  Reconstruction of infinite locally finite connected graphs. 60-97
  Electronic Edition (link) BibTeX
• Dameng Deng, Rolf S. Rees, Hao Shen:
  Further results on nearly Kirkman triple systems with subsystems. 98-113
  Electronic Edition (link) BibTeX
• Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang:
  Covering vertices of a graph by k disjoint cycles. 114-124
  Electronic Edition (link) BibTeX
• Katalin Friedl, Lajos Rónyai:
  Order shattering and Wilson's theorem. 126-135
  Electronic Edition (link) BibTeX
• Aicke Hinrichs, Christian Richter:
  New sets with large Borsuk numbers. 136-146
  Electronic Edition (link) BibTeX
• Xiang-Dong Hou:
  Rings and constructions of partial difference sets. 148-175
  Electronic Edition (link) BibTeX
• Franz Lehner:
  Cumulants, lattice paths, and orthogonal polynomials. 176-190
  Electronic Edition (link) BibTeX
• Manoel Lemos:
  Matroids with many common bases. 192-204
  Electronic Edition (link) BibTeX
• Vito Napolitano:
  On a class of finite linear spaces with few lines. 206-223
  Electronic Edition (link) BibTeX
• Vito Napolitano:
  Erratum to "On a class of finite linear spaces with few lines": [Discrete Mathematics 270 (2003) 207-224]. 224-225
  Electronic Edition (link) BibTeX
• Oliver Pretzel:
  On reorienting graphs by pushing down maximal vertices--II. 226-239
  Electronic Edition (link) BibTeX
• Dieter Rautenbach, Lutz Volkmann:
  On alpha_rgamma_s(k)-perfect graphs. 240-249
  Electronic Edition (link) BibTeX
• Lingsheng Shi:
  Upper bounds for Ramsey numbers. 250-264
  Electronic Edition (link) BibTeX
• Bertran Steinsky:
  Enumeration of labelled chain graphs and labelled essential directed acyclic graphs. 266-277
  Electronic Edition (link) BibTeX
• Paul Thomas Young:
  Congruences for degenerate number sequences. 278-288
  Electronic Edition (link) BibTeX
• M. H. Armanious:
  Semi-planar Steiner loops of cardinality 2n. 290-297
  Electronic Edition (link) BibTeX
• Toru Kojima:
  Bandwidth of the composition of two graphs. 298-308
  Electronic Edition (link) BibTeX
• Jixiang Meng, Zhao Zhang:
  Number of minimum vertex cuts in transitive graphs. 310-316
  Electronic Edition (link) BibTeX
• Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen:
  The smallest degree sum that yields potentially _kC_l-graphic sequences. 318-326
  Electronic Edition (link) BibTeX
• Michael Böttcher, Ulrich Knauer:
  Postscript: "Endomorphism spectra of graphs" [Discrete Mathematics 109 (1992) 45-57]. 328-330
  Electronic Edition (link) BibTeX
• Darla Kremer:
  Postscript: "Permutations with forbidden subsequences and a generalized Schro"der number" [Discrete Mathematics 218 (2000) 121-130]. 332-333
  Electronic Edition (link) BibTeX