1. A Degree Constraint for Uniquely Hamiltonian Graphs

   • Sarmad Abbasi
   • Asif Jamshed

   OriginalPaper Pages: 433 - 442

2. Almost Symmetric Cycles in Large Digraphs

   • Lech Adamus
   • A. Paweł Wojda

   OriginalPaper Pages: 443 - 452

3. Largest Non-Unique Subgraphs

   • Lars Døvling Andersen
   • Preben Dahl Vestergaard
   • Zsott Tuza

   OriginalPaper Pages: 453 - 470

4. On the Circuit-cocircuit Intersection Conjecture

   • S. R. Kingan
   • Manoel Lemos

   OriginalPaper Pages: 471 - 480

5. There Exist Highly Critically Connected Graphs of Diameter Three

   • Matthias Kriesell

   OriginalPaper Pages: 481 - 485

6. Optimal t-Edge-Robust r-Identifying Codes in the King Lattice

   • Tero Laihonen

   OriginalPaper Pages: 487 - 496

7. A Characterization of Graphs without Even Factors

   • Xueliang Li
   • Zhao Zhang

   OriginalPaper Pages: 497 - 502

8. Sizes of Critical Graphs with Small Maximum Degrees

   • Xuechao Li

   OriginalPaper Pages: 503 - 513

9. -Decompositions of and D _v ∪P where P is a 2-Regular Subgraph of D _v

   • Liqun Pu
   • Hung-Lin Fu
   • Hao Shen

   OriginalPaper Pages: 515 - 525

10. Alternating Paths along Axis-Parallel Segments

    • Csaba D. Tóth

    OriginalPaper Pages: 527 - 543

11. Kite-group Divisible Designs of Type g ^t u¹

    • Haiyan Wang
    • Yanxun Chang

    OriginalPaper Pages: 545 - 571