1. Toughness of Graphs and [2,b]-Factors

   • Ciping Chen

   OriginalPaper Pages: 97 - 100

2. On products of sets in groups

   • C. Delorme
   • Y. O. Hamidoune

   OriginalPaper Pages: 101 - 104

3. Different capacities of a digraph

   • Anna Galluccio
   • Luisa Gargano
   • Gábor Simonyi

   OriginalPaper Pages: 105 - 121

4. Spanning eulerian subgraphs of bounded degree in triangulations

   • Zhicheng Gao
   • Nicholas C. Wormald

   OriginalPaper Pages: 123 - 131

5. Cohen-Macaulay type of the face poset of a plane graph

   • Takayuki Hibi

   OriginalPaper Pages: 133 - 138

6. On the size of Edge-Chromatic critical graphs

   • K. Kayathri

   OriginalPaper Pages: 139 - 144

7. Families of sets with locally bounded width

   • Emanuel Knill

   OriginalPaper Pages: 145 - 157

8. Intersection Dimensions of Graph Classes

   • Jan Kratochvil
   • Zsolt Tuza

   OriginalPaper Pages: 159 - 168

9. Two edge-disjoint hamiltonian cycles in graphs

   • Mingchu Li

   OriginalPaper Pages: 169 - 178

10. Perfect graphs with noP ₅ and noK ₅

    • Frédéric Maffray
    • Myriam Preissmann

    OriginalPaper Pages: 179 - 184

11. On automorphism groups of some PCS graphs

    • Reginaldo M. Marcelo
    • Mari-Jo P. Ruiz
    • Ken-ichi Shinoda

    OriginalPaper Pages: 185 - 191

12. Iteratedk-line graphs

    • Bang Van Le
    • Erich Prisner

    OriginalPaper Pages: 193 - 203

13. Elementary strong maps of graphic matroids, II

    • András Recski

    OriginalPaper Pages: 205 - 206

14. Erratum

    • K. T. Arasu
    • Dieter Jungnickel
    • Alexander Pott

    Erratum Pages: 207 - 207

15. Size, chromatic number, and connectivity

    • J. Bhasker
    • Tariq Samad
    • Douglas B. West

    OriginalPaper Pages: 209 - 213

16. Anti-mitre steiner triple systems

    • Charles J. Colbourn
    • Eric Mendelsohn
    • Jozef Širáň

    OriginalPaper Pages: 215 - 224

17. Minimizing and maximizing the diameter in orientations of graphs

    • G. Gutin

    OriginalPaper Pages: 225 - 230

18. Note on eccentricities in tournaments

    • M. Harminc
    • J. Ivančo

    OriginalPaper Pages: 231 - 234

19. Spectral Characterization of Odd Graphs O_k,k ≤6

    • Tayuan Huang

    OriginalPaper Pages: 235 - 240

20. Edge domatic numbers of complete n- partite graphs

    • Shiow-Fen Hwang
    • Gerard J. Chang

    OriginalPaper Pages: 241 - 248

21. Every 4-Connected Line Graph of a Planar Graph is Hamiltonian

    • Hong-Jian Lai

    OriginalPaper Pages: 249 - 253

22. A few applications of negative- type inequalities

    • M. Deza
    • H. Maehara

    OriginalPaper Pages: 255 - 262

23. Slightly triangulated graphs are perfect

    • Frédéric Maire

    OriginalPaper Pages: 263 - 268

24. About a conjecture on the centers of chordal graphs

    • K. S. Parvathy
    • A. Remadevi
    • A. Vijayakumar

    OriginalPaper Pages: 269 - 270

25. Independent cycles with limited size in a graph

    • Hong Wang

    OriginalPaper Pages: 271 - 281

26. Some best possible bounds concerning the traces of finite sets

    • M. Watanabe
    • P. Frankl

    OriginalPaper Pages: 283 - 292

27. Some results on multipliers and numerical multiplier groups of difference sets

    • Qing Xiang

    OriginalPaper Pages: 293 - 304

28. Graphoidal bipartite graphs

    • S. Arumugam
    • C. Pakkiam

    OriginalPaper Pages: 305 - 310

29. Protecting convex sets

    • Jurek Czyzowicz
    • Eduardo Rivera-Campo
    • Joseph Zaks

    OriginalPaper Pages: 311 - 321

30. Recognizing the P₄-structure of a tree

    • Guoli Ding

    OriginalPaper Pages: 323 - 328

31. New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs

    • H. Galeana-Sánchez
    • V. Neumann-Lara

    OriginalPaper Pages: 329 - 336

32. On Edge Semi-Isomorphisms and Semi-Dualities of Graphs

    • A. K. Kelmans

    OriginalPaper Pages: 337 - 352

33. Neighbourhood-Perfect Line Graphs

    • Jenö Lehel†

    OriginalPaper Pages: 353 - 361

34. A Short Proof of a Theorem of Reid and Parker on Tournaments

    • V. Neumann-Lara

    OriginalPaper Pages: 363 - 366

35. On Tournaments and Their Largest Transitive Subtournaments

    • Adolfo Sanchez-Flores

    OriginalPaper Pages: 367 - 376

36. Upper Bounds for a Ramsey Theorem for Trees

    • C. J. Swanepoel
    • L. M. Pretorius

    OriginalPaper Pages: 377 - 382

37. Representation of Signed Graphs by Root System E₈

    • G. R. Vijayakumar

    OriginalPaper Pages: 383 - 388

38. Disproof of a Conjecture in the Domination Theory

    • I. E. Zverovich
    • V. E. Zverovich

    OriginalPaper Pages: 389 - 396