| 1 | -- | 0 | Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter. Preface |
| 3 | -- | 17 | Liliana Alcón, Marisa Gutierrez. Cliques and extended triangles. A necessary condition for planar clique graphs |
| 19 | -- | 39 | Stéphan Ceroi, Frédéric Havet. Trees with three leaves are (n+1)-unavoidable |
| 41 | -- | 91 | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic. Decomposition of odd-hole-free graphs by double star cutsets and 2-joins |
| 93 | -- | 101 | Simone Dantas, Sylvain Gravier, Frédéric Maffray. Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum |
| 103 | -- | 117 | Luc Devroye, Carlos Zamora-Cura. Expected worst-case partial match in random quadtries |
| 119 | -- | 134 | Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto. On the complexity of the approximation of nonplanarity parameters for cubic graphs |
| 135 | -- | 148 | Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport. AT-free graphs: linear bounds for the oriented diameter |
| 149 | -- | 159 | Zhicheng Gao, Jianyu Wang. Exact enumeration of rooted 3-connected triangular maps on the projective plane |
| 161 | -- | 183 | Ryan B. Hayward, William J. Lenhart. Bichromatic P::4::-composition schemes for perfect orderability |
| 185 | -- | 194 | Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. Partitioning chordal graphs into independent sets and cliques |
| 195 | -- | 207 | Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. Clique divergent clockwork graphs and partial orders |
| 209 | -- | 223 | Lauro Lins, Sóstenes Lins, Silvio Melo. Phorma: perfectly hashable order restricted multidimensional arrays |
| 225 | -- | 241 | Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi. An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid |
| 243 | -- | 253 | Lucia Draque Penso, Valmir C. Barbosa. A distributed algorithm to find k-dominating sets |
| 255 | -- | 261 | Miguel A. Pizaña. Distances and diameters on iterated clique graphs |
| 263 | -- | 276 | Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa. Bounds for optimal coverings |
| 277 | -- | 294 | Abilio Lucena, Mauricio G. C. Resende. Strong lower bounds for the prize collecting Steiner problem in graphs |