• Li-Da Tong. Full Orientability of Graphs
  • Vadim Lozin. Parameterized complexity of the maximum independent set problem and the speed of hereditary properties
  • Juanjo Rué, Konstantinos Stavropoulos and Dimitrios Thilikos. Outerplanar Obstructions for the Feedback Vertex Set
  • Cédric Bentz. New results on planar and directed multicuts
  • Archontia Giannopoulou and Dimitrios Thilikos. Obstructions for Tree-depth
  • Lubomír Török, Imrich Vrto, Stefan Dobrev, Rastislav Královic and Dana Pardubská. Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
  • Daniela Kuehn, Deryk Osthus and Andrew Treglown. Degree sequences forcing Hamilton cycles in directed graphs
  • Deryk Osthus, Daniela Kuehn and Luke Kelly. Short cycles in oriented graphs
  • Tomer Kotek. On the reconstruction of graph polynomials
  • Jiaojiao Wu and Andre Raspaud. Game chromatic number of toroidal grids
  • Dmitry Shabanov and Anastasia Rozovskaya. On the Problem of Erdos and Hajnal in the Case of List Colorings
  • Patrice Ossona de Mendez and Jaroslav Nesetril. Counting Homomorphisms to Sparse Graphs
  • Yared Nigussie. Extended Gallai's Theorem
  • Ehsan Chiniforooshan and Baoyindureng Wu. Maximum values of Szeged index and edge-Szeged index of graphs
  • Louis Esperet, František Kardoš and Daniel Král. Cubic bridgeless graphs have more than a linear number of perfect matchings
  • Nathann Cohen, Frederic Havet and Tobias Mueller. Acyclic edge-colouring of planar graphs. Extended abstract
  • Noga Alon, Dan Hefetz and Michael Krivelevich. Playing to retain the advantage
  • Simone Rinaldi, Filippo Disanto, Luca Ferrari and Renzo Pinzani. Combinatorial properties of Catalan pairs
  • Andrei Raigorodskii and Andrei Kupavskii. On the chromatic numbers of small-dimensional Euclidean spaces
  • Oleg Rubanov and Andrei Raigorodskii. Small clique and large chromatic number
  • Vitaliy Koshelev. On Erd\H{o}s--Szekeres-type problems
  • Demetres Christofides. Randomized algorithms for the majority problem
  • Ronnie Barequet, Gill Barequet and Guenter Rote. Formulae and Growth Rates of High-Dimensional Polycubes
  • Yury Person and Mathias Schacht. An expected polynomial time algorithm for coloring $2$-colorable $3$-graphs
  • Abhijin Adiga and Sunil L Chandran. Cubicity of Interval Graphs and the Claw Number
  • Paul Dorbec, Sylvain Gravier, Iiro Honkala and Michel Mollard. Weighted codes in Lee metric
  • Yulia Kempner and Vadim Levit. Distributive Lattice Polyhedra
  • Anna de Mier and Marc Noy. On the maximum number of cycles in outerplanar and series-parallel graphs
  • Domingos, Jr. Dellamonica and Vojtech Rodl. Hereditary quasi-random properties of hypergraphs
  • Henning Bruhn and Maya Stein. Characterising claw-free t-perfect graphs
  • Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz and Bettina Speckmann. Flip Graphs of Degree-Bounded Triangulations
  • Zoltan Furedi and Lale Ozkahya. On even-cycle-free subgrqaphs of the hypercube
  • Le Anh Vinh. On the distribution of permanents of matrices over finite fields
  • Daniel Kral, Edita Macajova, Jan Mazak and Jean-Sebastien Sereni. Circular edge-colorings of cubic graphs with girth six
  • Petter Branden. Discrete concavity and the half-plane property
  • Luis Pedro Montejano, Camino Balbuena and Pedro García Vázquez. On the Superconnectivity in graphs with odd girth g and even girth h
  • Friedrich Eisenbrand and Martin Niemeier. Coloring Fuzzy Circular Interval Graphs
  • Emilie Diot and Cyril Gavoille. On the Path Separability of Planar Graphs
  • Anna Huber and Nikolaos Fountoulakis. Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
  • Michel Habib and Juraj Stacho. A Decomposition Theorem for Chordal Graphs and its Applications
  • Otfried Cheong, Xavier Goaoc and Andreas Holmsen. Lower Bounds for Pinning Lines by Balls
  • Zoltán Füredi and Attila Sali. Partition Critical Hypergraphs
  • Cristina Dalfó, Miquel Ŕngel Fiol and Ernest Garriga. On t-Cliques in k-Walk-Regular Graphs
  • David Auger. Identifying Codes in Trees and Planar Graphs
  • Guy Wolfovitz. 4-cycles at the triangle-free process
  • Youssou Dieng and Cyril Gavoille. On the Tree-Width of Planar Graphs
  • Diana Piguet, Julia Boettcher and Jan Hladky. The tripartite Ramsey number for trees
  • Criel Merino, Marcelino Ramírez and M. Guadalupe Rodríguez. A note on some inequalities for the Tutte polynomial of a matroid
  • Oliver Cooley, Jan Hladky and Diana Piguet. Loebl-Komlos-Sos Conjecture: dense case
  • Reto Spöhel, Angelika Steger and Henning Thomas. Coloring the edges of a random graph without a monochromatic giant component
  • Jan Hladky, Daniel Kral and Sergey Norin. Counting flags in triangle-free digraphs
  • Petr Gregor. Hypercube 1-factorizations from extended Hamming codes
  • Marcin Kaminski, Paul Medvedev and Martin Milanic. On the Plane-Width of Graphs
  • Nikolaos Fountoulakis and Bruce Reed. A general critical condition for the emergence of a giant component in random graphs with given degrees
  • Rommel Barbosa, Mitre Dourado, Erika Martins and Jayme Szwarcfiter. The Colorful Helly Property for Hypergraphs
  • Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller and Joe Ryan. On Extremal Graphs with Bounded Girth
  • Min CHEN and André Raspaud. Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
  • Kolja Knauer. Chip-Firing, Antimatroids, and Polyhedra
  • Anna Lladó and Jordi Moragas. On the Sumset Partition Problem
  • Luke Postle, Noah Streib and Carl Yerger. Pebbling Graphs of Diameter Three and Four
  • Bernard Ries. Some properties of edge intersection graphs of single bend paths on a grid
  • TomᚠDvorák, Jirí Fink, Petr Gregor and Václav Koubek. Long paths and cycles in faulty hypercubes: existence, optimality, complexity
  • Konstantinos Panagiotou and Makrand Sinha. Vertices of Degree k in Random Unlabeled Trees
  • William Kennedy, Conor Meagher and Bruce Reed. Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
  • Martin Tancer. d-collapsibility is NP-complete for d greater or equal to 4
  • Ilan Goldfeder and Hortensia Galeana-Sanchez. A classification of arc-locally semicomplete digraphs
  • Zoltan Furedi and Lale Ozkahya. Unavoidable subhypergraphs: a-clusters
  • Olivier Togni. $\ell$-distant Hamiltonian walks in Cartesian product graphs
  • Peter Allen, Julia Böttcher, Jan Hladký and Oliver Cooley. Minimum degree conditions for large subgraphs
  • Luke Postle, Arash Asadi and Robin Thomas. Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
  • Stephan Brandt and Elizabeth Ribe-Baumann. Graphs of odd girth 7 with large degree
  • Oriol Serra and Gilles Zemor. Cycle codes of graphs and MDS Array codes
  • Zdenek Dvorak and Bojan Mohar. Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
  • Nicolas Sonnerat and Adrian Vetta. Defending Planar Graphs against Star-Cutsets
  • Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi and Tadashi Sakuma. Disjoint Even Cycles Packing
  • Cedric Chauve, Jan Manuch and Murray Patterson. On the Gapped Consecutive Ones Property
  • Amanda Montejano and Oriol Serra. Rainbow--free $3$--colorings in abelian groups
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou and Stéphan Thomassé. Spanning galaxies in digraphs
  • Kenta Ozeki. Spanning trees in $3$-connected $K_{3,t}$-minor-free graphs
  • Delia Garijo, M. Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, Jose Ramón Portillo, Pedro Reyes, Rafael Robles and Jesús Valenzuela. Monochromatic geometric k-factors in red-blue sets with white and Steiner points
  • Francesc Aguiló-Gost and Pedro A. García-Sánchez. Factorization and catenary degree in 3-generated numerical semigroups
  • Allan Lo. Cliques in graphs with bounded minimum degree
  • Roland Grappe, Attila Bernáth and Zoltán Szigeti. Augmenting edge-connectivity of a hypergraph by adding a multipartite graph
  • Joergen Bang-Jensen and Matthias Kriesell. Disjoint sub(di)graphs in digraphs
  • Tomoki Nakamigawa, Shinya Fujita and Tadashi Sakuma. Colored Pebble Motion on Graphs
  • Roland Häggkvist. Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck
  • Hervé Hocquard and Mickaël Montassier. Acyclic choosability of planar graphs : a Steinberg like approach
  • Louis Esperet, daniel gonçalves and Arnaud Labourel. Coloring a set of touching strings
  • Hanno Lefmann, Carlos Hoppen and Yoshiharu kohayakawa. Kneser Colorings in Uniform Hypergraphs
  • Mike J. Grannell, Terry S. Griggs, Edita Macajova and Martin Skoviera. Wilson-Schreiber Colourings of Cubic Graphs
  • Delia Garijo, Andrew Goodall and Jaroslav Nesetril. Graph homomorphisms, the Tutte polynomial and ``q-state Potts uniqueness''
  • Edita Macajova and Martin Skoviera. On a Conjecture of Fan and Raspaud
  • Benjamin Doerr, Tobias Friedrich and Thomas Sauerwald. Quasirandom Rumor Spreading on Expanders
  • Julia Böttcher and Sybille Müller. Forcing spanning subgraphs via Ore type conditions
  • Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo. Avoider-Enforcer: The Rules of the Game
  • Nicole Eggemann and Steven Noble. Minimizing the Oriented Diameter of a Planar Graph
  • Guillaume Fertin and Stéphane Vialette. On the S-Labeling problem
  • Agelos Georgakopoulos. Every rayless graph has an unfriendly partition
  • Jang Soo Kim. A bijection between two variations of noncrossing partitions
  • Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé and Laurent Vuillon. Codings of rotations on two intervals are full
  • Ross Kang and Putra Manggala. On distance edge-colourings and matchings
  • Emeric Gioan and Michel Las Vergnas. A Linear Programming Construction of Fully Optimal Bases resp. Spanning Trees
  • Mareike Massow and Stefan Felsner. Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets
  • Tomas Kaiser and Petr Vrana. Hamilton cycles in 6-connected claw-free graphs
  • Ida Kantor and Zoltan Furedi. List colorings with distinct list sizes, the case of complete bipartite graphs
  • Binh-Minh Bui-Xuan and Michel Habib. Unifying the representation of symmetric crossing families and weakly partitive families
  • Benjamin Doerr and Mahmoud Fouz. A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
  • Geoffrey Exoo and Robert Jajcay. Properties of Groups for the Cage and Degree/Diameter Problems
  • Francis Raj S and Balakrishnan Rangaswami. Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
  • Ervin Gyori and Nathan Lemons. Hypergraphs with no odd cycle of given length
  • Amanda Montejano, Alexandre Pinlou, André Raspaud and Éric Sopena. Chromatic number of sparse colored mixed planar graphs