189 | -- | 218 | Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye. The chromatic equivalence class of graph ::::‾{B::n-6, 12::}:::: |
219 | -- | 228 | Rangaswami Balakrishnan, S. Francis Raj. The Wiener number of Kneser graphs |
229 | -- | 247 | Mohammed M. M. Jaradat. Minimal cycle bases of the lexigraphic product of graphs |
249 | -- | 265 | Francesc A. Muntaner-Batle, Miquel Rius-Font. On the structure of paths-like trees |
267 | -- | 282 | William Klostermeyer, Christina M. Mynhardt. Secure domination and secure total domination in graphs |
285 | -- | 306 | Hortensia Galeana-Sánchez, Rocío Rojas-Monroy. Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments |
307 | -- | 321 | S. Aparna Lakshmanan, Ambat Vijayakumar. Clique irreducibility of some iterative classes of graphs |
323 | -- | 333 | Simon Spacapan, Aleksandra Tepeh. On acyclic colorings of direct produts |
335 | -- | 343 | Anthony Bonato, Changping Wang. A note on domination parameters in random graphs |
345 | -- | 359 | Hong-Hai Li, Jiong-Sheng Li. An upper bound on the Laplacian spectral radius of the signed graphs |
361 | -- | 366 | Torsten Korneffel, Dirk Meierling, Lutz Volkmann. A remark on the (2, 2)-domination number |
367 | -- | 373 | Thomas Böhme, Tobias Gerlach, Michael Stiebitz. Ordered and linked chordal graphs |
375 | -- | 378 | Mariusz Meszka. Solution to the problem of Kubesa |