- William F. Klostermeyer and C. M. Mynhardt: Vertex Covers and Eternal Domination
- Ismael González Yero and Juan Alberto Rodriguez Velazquez: On some classes of graphs having its geodetic number less than or equal to its Steiner number
- Arnold Brener: Several Problems in Characterization of the Partitions Belonging to Graphs with the Given Properties
- Sylvain Gravier, Matjaž Kovše and Aline Parreau: Generalized Sierpiński graphs
- Shivarajkumar and Sureshmanjanath Hegde: On Graceful Digraphs
- Shoichi Tsuchiya: On root vertices of rooted HISTs of planar triangulations
- Ali Deniz, Şahin Koçak, Yunus Özdemir and A. Ersin Üreyen: On The Realizations of Weighted Directed Graphs as Graph-Directed Iterated Function Systems
- Andres M. Encinas, Enrique Bendito, Angeles Carmona and Margarida Mitjana: Strongly regular and pseudo geometric graph
- Andres M. Encinas, Enrique Bendito, Angeles Carmona and Margarida
Mitjana:
On the
*M*-matrix inverse problem for symmetric singular tridiagonal matrices - Huilan Chang: Sortabilities of properties in multi-dimensional parameter spaces
- Andrea Jimenez and Marcos Kiwi: On the complexity of counting and deciding existence of Satisfying Spin-Assignments in Triangulations
- S. Bermudo and H. Fernau: Using Extremal Combinatorics to Bound the Differential of a Graph by Its Order
- Mohsen Jannesari and Behnaz Omoomi: The Metric Dimension of the Composition Product of Graphs
- Ali Behtoei and Behnaz Omoomi: On The Locating Chromatic Number of Cartesian Product of Graphs
- Maria Simonetta Bernabei and Horst Thaler: Combinatorics of coloured hard-dimers
- Przemysław Krysztowiak: Approximating the jump number of interval orders using 3-set cover algorithms
- Roman Glebov, Anita Liebenau and Tibor Szabó:
Concentration of the Domination number of
*G(n, p)* - Ghaffar Raeisi: On total group choosability of graphs
- A. Khamseh and G. R. Omidi: A generalization of Ramsey theory for linear forests
- Seema Varghese and Ambat Vijayakumar: Power domination in some classes of graphs