Super-Simple Twofold Steiner Pentagon Systems R. J. R. AbelF. E. Bennett Original Paper 15 May 2011 Pages: 297 - 308
Exponentially Many Monochromatic n-Matchings in K 3n-1 Ni CaoHan Ren Original Paper 10 May 2011 Pages: 309 - 314
A Characterization of Graphs Where the Independence Number Equals the Radius Ermelinda DeLaViñaCraig E. LarsonBill Waller Original Paper 14 June 2011 Pages: 315 - 332
On the Convexity Number of Graphs Mitre C. DouradoFábio ProttiJayme L. Szwarcfiter Original Paper 22 April 2011 Pages: 333 - 345
Finding a Sun in Building-Free Graphs Elaine M. EschenChính T. HoàngR. Sritharan Original Paper 01 May 2011 Pages: 347 - 364
Token Graphs Ruy Fabila-MonroyDavid Flores-PeñalozaDavid R. Wood Original Paper 25 May 2011 Pages: 365 - 380
Small Edge Sets Meeting all Triangles of a Graph S. Aparna LakshmananCs. BujtásZs. Tuza Original Paper 17 April 2011 Pages: 381 - 392
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs Christian LöwensteinDieter Rautenbach Original Paper 26 April 2011 Pages: 407 - 421
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs Zan-Bo ZhangXiaoyan ZhangXuelian Wen Original Paper 01 April 2011 Pages: 433 - 448