- Michael O. Albertson, The Chromatic Number and the Crossing Number
- Robert E.L. Aldred, Bounding the maximum number of cycles in a graph with $p$ vertices and $q$ edges
- Dan Archdeacon, Superthrackles
- Tinaz Ekim Asici, Generalized Colorings with Applications to some Problems in Robotics
- Jáanos Barát, Islands
- Thomas Böhme, On applications of graph theory in game theory
- Adrian Bondy, Paths and Cycles in Digraphs
- Oleg Borodin, Recent results on the planar 3-coloring
- Debra Boutin, The Cost of $2$-Distinguishing
- Stephan Brandt, Dense graphs with large odd girth
- Kathie Cameron, Coflow, Covering Vertices by Directed Circuits, and a Lower Bound on the Stability Number of a Graph
- Carl Johan Casselgren, Interval edge colorings of $(a, b)$-biregular bipartite graphs
- Gek Ling Chia, Grinberg's Criterion on Non-Planar Graphs
- Maria Chudnovsky, The structure of bullfree graphs
- Reinhard Diestel, $\pi_1(|G|)$, earrings, and limits of free groups
- Jack Edmonds, Euler Complexes
- Herbert Fleischner, Carsten's contributions to the Hamiltonian theme
- John Gimbel, Defective Cocolorings of Graphs
- Ronald J. Gould, Distributing vertices on hamiltonian cycles
- Gregory Gutin, Out-branchings with Extremal Number of Leaves
- Ervin Györi, On $2$-factors in graphs
- Roland Häggkvist, Some facts about (a, b)-biregular bigraphs and path factors
- Pavol Hell, Graphs and Polymorphisms
- Jing Huang, Partitions and bichromatic numbers of graphs
- Joan Hutchinson, Extending precolorings to list-colorings
- Tommy R. Jensen, Circuit Double Covers and locally Tait colourings
- Tibor Jordán, Graph theoretical characterization of uniquely localizable networks
- Ken-ichi Kawarabayashi, From Carsten's Proofs/Results to Hadwiger's Conjecture
- Martin Kochol, A negative solution of the edge-coloring conjecture of Grünbaum
- Alexandr V. Kostochka, Coloring simple uniform hypergraphs of small size
- Jan Kratochvíl, Generalized domination in special graph classes
- Matthias Kriesell, Packing Steiner Trees
- Daniela Kühn, Hamilton cycles in directed graphs
- Vadim V. Lozin, Boundary properties of graphs
- Gary MacGillivray, Injective homomorphisms of directed graphs
- Wolfgang Mader, Openly disjoint circuits through a vertex
- Brendan McKay, Recursive generation of 5-regular planar graphs
- Bojan Mohar, Coloring parameters and genus
- Jaroslav Nesetril, On nowhere dense and somewhere dense - a graph trichotomy
- Deryk Osthus, Cycles of given length in oriented graphs
- Shariefuddin Pirzada, Some Lists in Bipartite Multi-Hypertournaments
- Michael D. Plummer, Bounding the size of equimatchable graphs of fixed genus
- André Raspaud, Star coloring of sparse graphs
- Dieter Rautenbach, Edge-Injective and Edge-Surjective Vertex Labellings
- Bruce Reed, Parity Minors and Parity Routing
- Bruce Richter, Theorems of Maclane and Whitney for Graph-Like Spaces
- Gert Sabidussi, Independent Sets in 4-Regular Hamiltonian Graphs
- Horst Sachs, Spectral theory of $n$-fold periodic graphs with applications to toroidal $6$-cages, $(3,6)$-cages, and $(2,6)$-cages
- Paul Seymour, The densest graphs with no $K_{2,t}$ minor
- Ingo Schiermeyer, Approximation algorithms for the minimum rainbow subgraph problem
- Michael Stiebitz, Edge Colouring of Multigraphs
- Matej Stehlík, The chromatic number of triangle-free graphs on the double torus
- Robin Thomas, Beyond Grötzsch's theorem
- Carsten Thomassen, On the theorems of Menger and Kuratowski
- Mikkel Thorup, Efficient Cuts via Greedy Tree Packing
- Jan van den Heuvel, Distance-Two Colouring of Graphs
- Douglas B. West, Degree Ramsey and On-line Degree Ramsey numbers
- Anders Yeo, Total domination, transversals in hypergraphs and an FPT algorithm!
- Daniel Younger, Grötzsch's 3-Colour Theorem in Terms of Integer Flows
- Manouchehr Zaker, Lower and upper bounds for chromatic number and some open problems
- Xuding Zhu, Bipartite density and bipartite ratio of triangle-free subcubic graphs