Discrete Mathematics, Volume 190

Volume 190, Numbers 1-3, August 1998

• R. Julian R. Abel, Frank E. Bennett:
  The existence of perfect Mendelsohn designs with block size 7. 1-14
  Electronic Edition (link) BibTeX
• Denise Amar, Olivier Togni:
  Irregularity strength of trees. 15-38
  Electronic Edition (link) BibTeX
• Artur Andrzejak:
  An algorithm for the Tutte polynomials of graphs of bounded treewidth. 39-54
  Electronic Edition (link) BibTeX
• Esther M. Arkin, Refael Hassin:
  Graph partitions with minimum degree constraints. 55-65
  Electronic Edition (link) BibTeX
• S. Arumugam, J. Suresh Suseela:
  Acyclic graphoidal covers and path partitions in a graph. 67-77
  Electronic Edition (link) BibTeX
• Anant P. Godbole, Laura K. Potter, Erik Jonathan Sandquist:
  Sign-balanced covering matrices. 79-93
  Electronic Edition (link) BibTeX
• Gregory Gutin, Vadim E. Zverovich:
  Upper domination and upper irredundance perfect graphs. 95-105
  Electronic Edition (link) BibTeX
• Hugh Hind, Yue Zhao:
  Edge colorings of graphs embeddable in a surface of low genus. 107-114
  Electronic Edition (link) BibTeX
• K. M. Koh, E. G. Tay:
  On optimal orientations of cartesian products of graphs (I). 115-136
  Electronic Edition (link) BibTeX
• Krzysztof Kolodziejczyk:
  The boundary characteristic and the volume of lattice polyhedra. 137-148
  Electronic Edition (link) BibTeX
• Vladimir P. Korzhik:
  Triangular embeddings of K_n-K_m with unboundedly large m. 149-162
  Electronic Edition (link) BibTeX
• Dieter Kratsch, Jean-Xavier Rampon:
  Tree-visibility orders. 163-175
  Electronic Edition (link) BibTeX
• S. B. Mulay, C. G. Wagner:
  Finitary bases and formal generating functions. 177-189
  Electronic Edition (link) BibTeX
• Sanjay Rajpal:
  On binary k-paving matroids and Reed-Muller codes. 191-200
  Electronic Edition (link) BibTeX
• Vassil Yorgov:
  The extremal codes of length 42 with automorphism of order 7. 201-213
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  Chromatic Ramsey numbers. 215-222
  Electronic Edition (link) BibTeX
• Riste Skrekovski:
  Choosability of K₅-minor-free graphs. 223-226
  Electronic Edition (link) BibTeX
• Eberth Alarcon:
  An extremal result on convex lattice polygons. 227-234
  Electronic Edition (link) BibTeX
• Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
  A combinatorial interpretation of the recurrence f_n+1 = 6f_n - f_n-1. 235-240
  Electronic Edition (link) BibTeX
• Louis Caccetta, Rui-Zhong Jia:
  On a problem concerning ordered colourings. 241-245
  Electronic Edition (link) BibTeX
• Neil J. Calkin:
  On the structure of a random sum-free set of positive integers. 247-257
  Electronic Edition (link) BibTeX
• Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg:
  Permutations, parenthesis words, and Schröder numbers. 259-264
  Electronic Edition (link) BibTeX
• Wolf H. Holzmann, Hadi Kharaghani:
  A D-optimal design of order 150. 265-269
  Electronic Edition (link) BibTeX
• David Moews:
  Optimally pebbling hypercubes and powers. 271-276
  Electronic Edition (link) BibTeX
• Timothy B. Moorhouse, Derek G. Corneil:
  Completeness for intersection classes. 277-286
  Electronic Edition (link) BibTeX
• Lior Pachter, Peter Kim:
  Forcing matchings on square grids. 287-294
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  The toughness of split graphs. 295-297
  Electronic Edition (link) BibTeX