Discrete Mathematics, Volume 188

Volume 188, Numbers 1-3, June 1998

• Rudolf Ahlswede, Z. Zhang:
  Code pairs with specified parity of the Hamming distances. 1-11
  Electronic Edition (link) BibTeX
• Salar Y. Alsardary, Jerzy Wojciechowski:
  The basis number of the powers of the complete graph. 13-25
  Electronic Edition (link) BibTeX
• Ahmed M. Assaf:
  Directed covering with block size 5 and index even. 27-40
  Electronic Edition (link) BibTeX
• Bhaskar Bagchi, Basudeb Datta:
  A structure theorem for pseudomanifolds. 41-60
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Gregory Gutin:
  Alternating cycles and trails in 2-edge-coloured complete multigraphs. 61-72
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena:
  On universal graphs for planar oriented graphs of a given girth. 73-85
  Electronic Edition (link) BibTeX
• Niall Cairnie, Keith Edwards:
  The achromatic number of bounded degree trees. 87-97
  Electronic Edition (link) BibTeX
• James A. Davis:
  New semiregular divisible difference sets. 99-109
  Electronic Edition (link) BibTeX
• A. M. H. Gerards, F. Bruce Shepherd:
  Strong orientations without even directed circuits. 111-125
  Electronic Edition (link) BibTeX
• Masaaki Harada, T. Aaron Gulliver, Hitoshi Kaneta:
  Classification of extremal double-circulant self-dual codes of length up to 62. 127-136
  Electronic Edition (link) BibTeX
• Mirko Lepovic:
  On formal products and spectra of graphs. 137-149
  Electronic Edition (link) BibTeX
• MingChu Li:
  Vertex pancyclism in claw-free graphs. 151-173
  Electronic Edition (link) BibTeX
• Xueliang Li:
  Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. 175-182
  Electronic Edition (link) BibTeX
• Eckhard Steffen:
  Classifications and characterizations of snarks. 183-203
  Electronic Edition (link) BibTeX
• Stevo Todorcevic:
  Countable chain condition in partition calculus. 205-223
  Electronic Edition (link) BibTeX
• Liming Xiong:
  Edge degree conditions for subpancyclicity in line graphs. 225-232
  Electronic Edition (link) BibTeX
• Beifang Chen, Serge Lawrencenko:
  Structural characterization of projective flexibility. 233-238
  Electronic Edition (link) BibTeX
• Jochen Harant:
  A lower bound on the independence number of a graph. 239-243
  Electronic Edition (link) BibTeX
• Iliya Bluskov:
  Some t-designs are minimal (t + 1)-coverings. 245-251
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt:
  Irredundant and perfect neighbourhood sets in trees. 253-260
  Electronic Edition (link) BibTeX
• N. I. Glebov, Alexandr V. Kostochka:
  On the independent domination number of graphs with given minimum degree. 261-266
  Electronic Edition (link) BibTeX
• Olof Heden:
  Another Bruen chain. 267
  Electronic Edition (link) BibTeX
• Xinming Liu, Douglas B. West:
  Line digraphs and coreflexive vertex sets. 269-277
  Electronic Edition (link) BibTeX
• M. R. Sridharan, K. Balaji:
  Characterisation of self-complementary chordal graphs. 279-283
  Electronic Edition (link) BibTeX
• Litong Xie, Guizhen Liu, Baogang Xu:
  On endo-homology of complexes of graphs. 285-291
  Electronic Edition (link) BibTeX
• Likuan Zhao:
  The kissing number of the regular polygon. 293-296
  Electronic Edition (link) BibTeX
• Nedyalko Dimov Nenov:
  On the small graphs with chromatic number 5 without 4-cliques. 297-298
  Electronic Edition (link) BibTeX