1. On the Range of Possible Integrities of Graphs G(n, k)

   • Mustafa Atici
   • Claus Ernst

   Original Paper 26 October 2010 Pages: 475 - 485

2. Color Chain of a Graph

   • R. Balakrishnan
   • T. Kavaskar

   Original Paper 27 October 2010 Pages: 487 - 493

3. Forbiddance and Capacity

   • Emanuela Fachini
   • János Körner

   Original Paper 16 October 2010 Pages: 495 - 503

4. Higher Dimensional Moore Bounds

   • Michael Goff

   Original Paper 01 September 2010 Pages: 505 - 530

5. On the Roman Bondage Number of Planar Graphs

   • Nader Jafari Rad
   • Lutz Volkmann

   Original Paper 07 September 2010 Pages: 531 - 538

6. The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected

   • Petteri Kaski
   • Veli Mäkinen
   • Patric R. J. Östergård

   Original Paper 25 September 2010 Pages: 539 - 546

7. Pairs of Chromatically Equivalent Graphs

   • Kerri Morgan

   Original Paper 01 October 2010 Pages: 547 - 556

8. A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs

   • Stavros D. Nikolopoulos
   • Charis Papadopoulos

   Original Paper 20 October 2010 Pages: 557 - 565

9. Cleaning Random d-Regular Graphs with Brooms

   • Paweł Prałat

   Original Paper 05 October 2010 Pages: 567 - 584

10. Metric Dimension and R-Sets of Connected Graphs

    • Ioan Tomescu
    • Muhammad Imran

    Original Paper 19 October 2010 Pages: 585 - 591

11. The Spectrum of Tetrahedral Quadruple Systems

    • Jian Wang
    • Miao Liang
    • Beiliang Du

    Original Paper 02 October 2010 Pages: 593 - 602

12. Characterizations of Bent and Almost Bent Function on \({\mathbb{Z}_p^2}\)

    • Xiyong Zhang
    • Hua Guo
    • Zongsheng Gao

    Original Paper 16 September 2010 Pages: 603 - 620