Discrete Mathematics, Volume 231

Volume 231, Number 1-3, March 2001

• Douglas R. Woodall:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Vito Abatangelo, Gábor Korchmáros, Bambina Larato:
  Transitive parabolic unitals in translation planes of odd order. 3-10
  Electronic Edition (link) BibTeX
• R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:
  Steiner pentagon covering designs. 11-26
  Electronic Edition (link) BibTeX
• Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar:
  The mu-way intersection problem for m-cycle systems. 27-56
  Electronic Edition (link) BibTeX
• F. Aguiló, I. Diego:
  Discrete dynamics over double commutative-step digraphs. 57-72
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Michael D. Plummer:
  On restricted matching extension in planar graphs. 73-79
  Electronic Edition (link) BibTeX
• David Bedford, Matthew A. Ollis, Roger M. Whitaker:
  On bipartite tournaments balanced with respect to carry-over effects for both teams. 81-87
  Electronic Edition (link) BibTeX
• David Bedford, Roger M. Whitaker:
  Bounds on the maximum number of Latin squares in a mutually quasi-orthogonal set. 89-96
  Electronic Edition (link) BibTeX
• Halina Bielak:
  Roots of chromatic polynomials. 97-102
  Electronic Edition (link) BibTeX
• Anthony Bonato, Kathie Cameron:
  On an adjacency property of almost all graphs. 103-119
  Electronic Edition (link) BibTeX
• Robin Chapman:
  An involution on derangements. 121-122
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech:
  Ramsey properties of generalised irredundant sets in graphs. 123-134
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel:
  Edge disjoint monochromatic triangles in 2-colored graphs. 135-141
  Electronic Edition (link) BibTeX
• Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach:
  On domination and annihilation in graphs with claw-free blocks. 143-151
  Electronic Edition (link) BibTeX
• Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
  The place of super edge-magic labelings among other classes of labelings. 153-168
  Electronic Edition (link) BibTeX
• Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
  Partitions of factorisations of parameter words. 169-175
  Electronic Edition (link) BibTeX
• Joan Gimbert:
  Enumeration of almost Moore digraphs of diameter two. 177-190
  Electronic Edition (link) BibTeX
• Ronald J. Gould, Michael S. Jacobson:
  Two-factors with few cycles in claw-free graphs. 191-197
  Electronic Edition (link) BibTeX
• Mike J. Grannell, Terry S. Griggs, Fred C. Holroyd:
  Modular gracious labellings of trees. 199-219
  Electronic Edition (link) BibTeX
• Paul J. P. Grobler, Christina M. Mynhardt:
  Domination parameters and edge-removal-critical graphs. 221-239
  Electronic Edition (link) BibTeX
• Heiko Harborth, Ingrid Mengersen:
  Ramsey numbers in octahedron graphs. 241-246
  Electronic Edition (link) BibTeX
• Lars Hellström:
  Algebraic dependence of commuting differential operators. 247-252
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, Tomaz Slivnik, David S. G. Stirling:
  Aspects of edge list-colourings. 253-264
  Electronic Edition (link) BibTeX
• Thomas Honold, Ivan N. Landjev:
  On arcs in projective Hjelmslev planes. 265-278
  Electronic Edition (link) BibTeX
• Jing Huang, Gary MacGillivray, Kathryn L. B. Wood:
  Pushing the cycles out of multipartite tournaments. 279-287
  Electronic Edition (link) BibTeX
• Leif K. Jørgensen:
  Directed strongly regular graphs with mu=lambda. 289-293
  Electronic Edition (link) BibTeX
• A. Donald Keedwell:
  A characterization of the Jacobi logarithms of a finite field. 295-302
  Electronic Edition (link) BibTeX
• Domenico Labbate:
  On 3-cut reductions of minimally 1-factorable cubic bigraphs. 303-310
  Electronic Edition (link) BibTeX
• Guizhen Liu, Qinglin Yu:
  Generalization of matching extensions in graphs. 311-320
  Electronic Edition (link) BibTeX
• Per Håkan Lundow:
  Compression of transfer matrices. 321-329
  Electronic Edition (link) BibTeX
• Gary MacGillivray, A. Rodriguez:
  The achromatic number of the union of paths. 331-335
  Electronic Edition (link) BibTeX
• Sònia P. Mansilla, Oriol Serra:
  Construction of k-arc transitive digraphs. 337-349
  Electronic Edition (link) BibTeX
• John P. Morgan, Donald A. Preece, David H. Rees:
  Nested balanced incomplete block designs. 351-389
  Electronic Edition (link) BibTeX
• Stephanie Perkins, Adrian Escott:
  Extended synchronizing codewords for q-ary complete prefix codes. 391-401
  Electronic Edition (link) BibTeX
• Nicholas C. K. Phillips:
  Finding tight single-change covering designs with v=20, k=5. 403-409
  Electronic Edition (link) BibTeX
• Dieter Rautenbach:
  On vertex orderings and the stability number in triangle-free graphs. 411-420
  Electronic Edition (link) BibTeX
• Robert Shrock:
  Chromatic polynomials and their zeros and asymptotic limits for families of graphs. 421-446
  Electronic Edition (link) BibTeX
• Angelo Sonnino:
  One-factorizations of complete multigraphs arising from maximal (k;n)-arcs in PG(2, 2^h). 447-451
  Electronic Edition (link) BibTeX
• Meike Tewes, Lutz Volkmann:
  The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. 453-457
  Electronic Edition (link) BibTeX
• Kazuhiko Ushio, Yoshikazu Ohtsubo:
  K_{p, q}-factorization of symmetric complete tripartite digraphs. 459-467
  Electronic Edition (link) BibTeX