1. Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

   • Dalibor Fronček
   • Petr Kovář
   • Michael Kubesa

   Original Paper 02 November 2010 Pages: 621 - 646

2. All 4-Edge-Connected HHD-Free Graphs are \({\mathbb{Z}_3}\)-Connected

   • Takuro Fukunaga

   Original Paper 23 November 2010 Pages: 647 - 659

3. Turán Numbers for Disjoint Copies of Graphs

   • Izolda Gorgol

   Original Paper 05 January 2011 Pages: 661 - 667

4. Weakly Cycle Complementary 3-Partite Tournaments

   • Zhihong He
   • Yan Wang

   Original Paper 05 November 2010 Pages: 669 - 683

5. Perfect Matchings in Total Domination Critical Graphs

   • Michael A. Henning
   • Anders Yeo

   Original Paper 18 December 2010 Pages: 685 - 701

6. Construction of Hamilton Path Tournament Designs

   • Yoshiko T. Ikebe
   • Akihisa Tamura

   Original Paper 05 January 2011 Pages: 703 - 711

7. On Idomatic Partitions of Direct Products of Complete Graphs

   • Sandi Klavžar
   • Gašper Mekiš

   Original Paper 01 February 2011 Pages: 713 - 726

8. Sums of Powers of the Degrees of Graphs with k Cut Edges

   • Shuchao Li
   • Lixia Yan

   Original Paper 03 December 2010 Pages: 727 - 740

9. On the Chromatic Number of H-Free Graphs of Large Minimum Degree

   • Jeremy Lyle

   Original Paper 23 November 2010 Pages: 741 - 754

10. On Roman, Global and Restrained Domination in Graphs

    • V. Zverovich
    • A. Poghosyan

    Original Paper 05 November 2010 Pages: 755 - 768