Different capacities of a digraph Anna GalluccioLuisa GarganoGábor Simonyi OriginalPaper Pages: 105 - 121
Spanning eulerian subgraphs of bounded degree in triangulations Zhicheng GaoNicholas C. Wormald OriginalPaper Pages: 123 - 131
On automorphism groups of some PCS graphs Reginaldo M. MarceloMari-Jo P. RuizKen-ichi Shinoda OriginalPaper Pages: 185 - 191
Size, chromatic number, and connectivity J. BhaskerTariq SamadDouglas B. West OriginalPaper Pages: 209 - 213
Anti-mitre steiner triple systems Charles J. ColbournEric MendelsohnJozef Širáň OriginalPaper Pages: 215 - 224
Minimizing and maximizing the diameter in orientations of graphs G. Gutin OriginalPaper Pages: 225 - 230
Edge domatic numbers of complete n- partite graphs Shiow-Fen HwangGerard J. Chang OriginalPaper Pages: 241 - 248
Every 4-Connected Line Graph of a Planar Graph is Hamiltonian Hong-Jian Lai OriginalPaper Pages: 249 - 253
About a conjecture on the centers of chordal graphs K. S. ParvathyA. RemadeviA. Vijayakumar OriginalPaper Pages: 269 - 270
Some best possible bounds concerning the traces of finite sets M. WatanabeP. Frankl OriginalPaper Pages: 283 - 292
Some results on multipliers and numerical multiplier groups of difference sets Qing Xiang OriginalPaper Pages: 293 - 304
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs H. Galeana-SánchezV. Neumann-Lara OriginalPaper Pages: 329 - 336
A Short Proof of a Theorem of Reid and Parker on Tournaments V. Neumann-Lara OriginalPaper Pages: 363 - 366
On Tournaments and Their Largest Transitive Subtournaments Adolfo Sanchez-Flores OriginalPaper Pages: 367 - 376
Upper Bounds for a Ramsey Theorem for Trees C. J. SwanepoelL. M. Pretorius OriginalPaper Pages: 377 - 382
Disproof of a Conjecture in the Domination Theory I. E. ZverovichV. E. Zverovich OriginalPaper Pages: 389 - 396