| Belmannu | Acharya | Point-set domination in graphs |
| Mehdi | Alaeiyan | On the normality of Cayley graphs with certain degree |
| Kiyoshi | Ando | Contractible edges in a 4-connected graph |
| Janos | Barát | A contribution to queens graphs |
| Miklòs | Bartha | The Berge formula, and a calculus of barriers for maximum internal matchings in graphs |
| Martin | Cera | λ-optimality in graphs with even girth |
| Hsun-Wen | Chang | Labeling problem of cycles and powers of cycles with two distance-constrains |
| Nam-Po | Chiang | Effects of graph operations on point-distinguishing chromatic indices |
| Jason | Deboni | Consistent weighted graph layouts |
| Abel | Delgado | Perfect domination of rectangular grids |
| Paolo | Detti | The hamiltonian completion number of a line graph: algorithms and applications |
| Taoufik | Faik | About b-continuous graphs |
| Tamás | Fleiner | On a generalization of the stable roommates problem |
| Grzegorz | Gancarzewicz | 3-connected graphs with every matching in a hamiltonian cycle |
| Pedro | Garcìa-Vázquez | Connectivity in sequence graphs |
| Izolda | Gorgol | Planar Ramsey number for cycles |
| Harald | Gropp | From Sainte-Laguë to Claude Berge - French graph theory between 1926 and 1958 |
| Pierre | Hansen | Comparing graph invariants with autographix |
| Samuel | Jurkiewicz | Projective planes as minimal dominating subsets of Kneser graphs |
| Keiko | Kotani | k-factor and l-closure in graphs |
| Ewa | Kubicka | The chromatic sum of a graph; an overview and recent developments |
| Vadim | Levit | Very well-covered graphs and the unimodality conjecture |
| Nicolas | Lichiardopol | Lower bounds on the matching number of regular graphs |
| Yasuko | Matsui | On the enumeration of bipartite minimum edge colorings |
| Doostali | Mojdeh | On the defining number of K2n\ 1 -factors |
| Gyula | Nagy | Connectivity for rigidity |
| Rajaram | Poovazhaki | Weakly convex domination in graphs |
| Gaetano | Quattrocchi | Partial S(k-1,k,v)'s inducing Pk decompositions of Kv |
| Rocìo | Rojas-Monroy | Kernels, M-orientations and pretransitive orientations |
| Mateja | Šajna | Almost self-complementary graphs |
| David | Schindl | Some new NP-hard hereditary graph classes for graph coloring |
| Matěj | Stehlìk | Colouring of graphs with colour classes of bounded size |
| Fouad | Tigrine | The minimum feedback vertex set for Kronecker product of graphs |
| Morimasa | Tsuchiya | On hereditary double bound graphs |
| Mònica | Villanueva-llufi | Enumerating all maximal independent sets of a Meyniel graph |
| Claudia | Villela Maciel | Even pairs and bull-reducible graphs |
| Janez | Zerovnik | Coloring graphs and hypergraphs motivated by channel assignment |