1. Super-Simple Twofold Steiner Pentagon Systems

   • R. J. R. Abel
   • F. E. Bennett

   Original Paper 15 May 2011 Pages: 297 - 308

2. Exponentially Many Monochromatic n-Matchings in K _3n-1

   • Ni Cao
   • Han Ren

   Original Paper 10 May 2011 Pages: 309 - 314

3. A Characterization of Graphs Where the Independence Number Equals the Radius

   • Ermelinda DeLaViña
   • Craig E. Larson
   • Bill Waller

   Original Paper 14 June 2011 Pages: 315 - 332

4. On the Convexity Number of Graphs

   • Mitre C. Dourado
   • Fábio Protti
   • Jayme L. Szwarcfiter

   Original Paper 22 April 2011 Pages: 333 - 345

5. Finding a Sun in Building-Free Graphs

   • Elaine M. Eschen
   • Chính T. Hoàng
   • R. Sritharan

   Original Paper 01 May 2011 Pages: 347 - 364

6. Token Graphs

   • Ruy Fabila-Monroy
   • David Flores-Peñaloza
   • David R. Wood

   Original Paper 25 May 2011 Pages: 365 - 380

7. Small Edge Sets Meeting all Triangles of a Graph

   • S. Aparna Lakshmanan
   • Cs. Bujtás
   • Zs. Tuza

   Original Paper 17 April 2011 Pages: 381 - 392

8. s-Vertex Pancyclic Index

   • Zhang Lili
   • Yehong Shao
   • Ju Zhou

   Original Paper 02 June 2011 Pages: 393 - 406

9. Pairs of Disjoint Dominating Sets in Connected Cubic Graphs

   • Christian Löwenstein
   • Dieter Rautenbach

   Original Paper 26 April 2011 Pages: 407 - 421

10. On Half-Way AZ-Style Identities

    • Tran Dan Thu

    Original Paper 22 April 2011 Pages: 423 - 432

11. Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs

    • Zan-Bo Zhang
    • Xiaoyan Zhang
    • Xuelian Wen

    Original Paper 01 April 2011 Pages: 433 - 448