Discrete Mathematics, Volume 203

Volume 203, Numbers 1-3, May 1999

• Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura:
  A degree condition for the existence of 1-factors in graphs or their complements. 1-8
  Electronic Edition (link) BibTeX
• Sergei L. Bezrukov:
  On an equivalence in discrete extremal problems. 9-22
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Daniel P. Sanders, Yue Zhao:
  On cyclic colorings and their generalizations. 23-40
  Electronic Edition (link) BibTeX
• Lane Clark:
  Asymptotic normality of the Ward numbers. 41-48
  Electronic Edition (link) BibTeX
• Charles J. Colbourn, Alan C. H. Ling:
  Kirkman school project designs. 49-60
  Electronic Edition (link) BibTeX
• Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus:
  Restrained domination in graphs. 61-69
  Electronic Edition (link) BibTeX
• Feng Ming Dong, Khee Meng Koh:
  Structures and chromaticity of some extremal 3-colourable graphs. 71-82
  Electronic Edition (link) BibTeX
• Keith Edwards:
  The harmonious chromatic number of complete r-ary trees. 83-99
  Electronic Edition (link) BibTeX
• Ronald J. Gould, John M. Harris:
  Forbidden triples and traceability: a characterization. 101-120
  Electronic Edition (link) BibTeX
• Sylvain Gravier:
  On Tucker vertices of graphs. 121-131
  Electronic Edition (link) BibTeX
• Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau:
  Edge-disjoint spanners of complete graphs and complete digraphs. 133-159
  Electronic Edition (link) BibTeX
• Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
  The strong Hall property and symmetric chain orders. 161-168
  Electronic Edition (link) BibTeX
• Frantisek Matús:
  Matroid representations by partitions. 169-194
  Electronic Edition (link) BibTeX
• Allan D. Mills:
  On matroids with many common bases. 195-205
  Electronic Edition (link) BibTeX
• C. R. Pranesachar:
  A class of 'matching-equivalent' bipartite graphs. 207-213
  Electronic Edition (link) BibTeX
• Eric M. Rains:
  Optimal self-dual codes over Z₄. 215-228
  Electronic Edition (link) BibTeX
• Bert Randerath, Ingo Schiermeyer, Hong Wang:
  On quadrilaterals in a graph. 229-237
  Electronic Edition (link) BibTeX
• Dieter Rautenbach:
  On the differences between the upper irredundance, upper domination and independence numbers of a graph. 239-252
  Electronic Edition (link) BibTeX
• Yu Sheng, Feng Tian, Bing Wei:
  Panconnectivity of locally connected claw-free graphs. 253-260
  Electronic Edition (link) BibTeX
• T. Dridi:
  Distributions ordinales associées aux matrices 3-monotones. 261-265
  Electronic Edition (link) BibTeX
• Tomás Madaras:
  Note on weights of paths in polyhedral graphs. 267-269
  Electronic Edition (link) BibTeX
• Scott T. Chapman, Michael Freeze, William W. Smith:
  Minimal zero-sequences and the strong Davenport constant. 271-277
  Electronic Edition (link) BibTeX
• James F. Geelen:
  On matroids without a non-Fano minor. 279-285
  Electronic Edition (link) BibTeX
• Edward R. Scheinerman:
  Local representations using very short labels. 287-290
  Electronic Edition (link) BibTeX
• Raphael Yuster:
  Optimal factorizations of families of trees. 291-297
  Electronic Edition (link) BibTeX