Journal of Combinatorial Theory, Series B, Volume 73

Volume 73, Number 1, May 1998

• Ron Aharoni, Ron Holzman:
  Fractional Kernels in Digraphs. 1-6
  Electronic Edition (link) BibTeX
• Jens Lagergren:
  Upper Bounds on the Size of Obstructions and Intertwines. 7-40
  Electronic Edition (link) BibTeX
• Dragan Marusic:
  Half-Transitive Group Actions on Finite Graphs of Valency 4. 41-76
  Electronic Edition (link) BibTeX
• Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
  A Nebeský-Type Characterization for Relative Maximum Genus. 77-98
  Electronic Edition (link) BibTeX

Volume 73, Number 2, July 1998

• Edwin R. van Dam:
  Nonregular Graphs with Three Eigenvalues. 101-118
  Electronic Edition (link) BibTeX
• Lenhard L. Ng:
  Hamiltonian Decomposition of Lexicographic Products of Digraphs. 119-129
  Electronic Edition (link) BibTeX
• Judith Keijsper, Rudi Pendavingh:
  An Efficient Algorithm for Minimum-Weight Bibranching. 130-145
  Electronic Edition (link) BibTeX
• Pavel Valtr:
  On the Density of Subgraphs in a Graph with Bounded Independence Number. 146-158
  Electronic Edition (link) BibTeX
• Dan Pritikin:
  All Unit-Distance Graphs of Order 6197 Are 6-Colorable. 159-163
  Electronic Edition (link) BibTeX
• Cai Heng Li, Cheryl E. Praeger, Ming Yao Xu:
  Isomorphisms of Finite Cayley Digraphs of Bounded Valency. 164-183
  Electronic Edition (link) BibTeX
• Judith Keijsper, Alexander Schrijver:
  On Packing Connectors. 184-188
  Electronic Edition (link) BibTeX
• Michael O. Albertson:
  You Can't Paint Yourself into a Corner. 189-194
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  Pattern Periodic Coloring of Distance Graphs. 195-206
  Electronic Edition (link) BibTeX