207 | -- | 214 | Bert Seamone. On uniquely Hamiltonian claw-free and triangle-free graphs |
215 | -- | 227 | Ayushi Dhama, Deepa Sinha. •(S) |
229 | -- | 235 | Ruixia Wang. k-transitive digraphs |
237 | -- | 247 | Henry Escuadro, Futaba Fujie, Chad E. Musick. A note on the total detection numbers of cycles |
249 | -- | 260 | Yi-Zheng Fan, Xiao-Xin Li, Yi Wang, Fei-Fei Zhang. The least eigenvalue of graphs whose complements are unicyclic |
261 | -- | 270 | J. Amjadi, N. Mohammadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann. k-rainbow bondage number of a digraph |
271 | -- | 281 | Zhenming Bi, Ping Zhang. k-path pancyclic graphs |
283 | -- | 300 | William F. Klostermeyer, Christina M. Mynhardt. Domination, eternal domination and clique covering |
301 | -- | 311 | Hasan Al-Ezeh, Omar A. AbuGheim, Eman A. AbuHijleh. Characterizing which powers of hypercubes and folded hypercubes are divisor graphs |
313 | -- | 314 | Ewa Drgas-Burchardt, Elzbieta Sidorowicz. Preface |
315 | -- | 327 | Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lemanska, Rita Zuazua. Total domination multisubdivision number of a graph |
329 | -- | 334 | Jens-P. Bode, Anika Fricke, Arnfried Kemnitz. Improved sufficient conditions for Hamiltonian properties |
335 | -- | 353 | Markus Dod, Tomer Kotek, James Preen, Peter Tittmann. Bipartition polynomials, the Ising model and domination in graphs |
355 | -- | 363 | Jochen Harant, Julia Niebling, Sebastian Richter. Eigenvalue conditions for induced subgraphs |
365 | -- | 386 | Christoph Brause, Ngoc C. Le, Ingo Schiermeyer. Extending the Max Algorithm for maximum independent set |
387 | -- | 398 | Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao. n-1 |