default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 66
Volume 66, December 2017
- Jaroslav Nesetril
, Oriol Serra:
Preface. 1-4 - Karim A. Adiprasito:
A note on the simplex-cosimplex problem. 5-12 - Martin Balko, Pavel Valtr:
A SAT attack on the Erdős-Szekeres conjecture. 13-23 - Imre Bárány:
Helge Tverberg is eighty: A personal tribute. 24-27 - Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi:
Decomposing regular graphs with prescribed girth into paths of given length. 28-36 - Amin Coja-Oghlan, Will Perkins, Kathrin Skubch:
Limits of discrete distributions and Gibbs measures on random graphs. 37-59 - Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. 60-80 - François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. 81-94 - Zdenek Dvorák, Ken-ichi Kawarabayashi:
Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. 95-100 - Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril:
Fractal property of the graph homomorphism order. 101-109 - Robert Hancock, Andrew Treglown:
On solution-free sets of integers. 110-128 - Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz:
On the generalised colouring numbers of graphs that exclude a fixed minor. 129-144 - Lucas Hosseini, Jaroslav Nesetril, Patrice Ossona de Mendez:
Limits of mappings. 145-159 - Winfried Hochstättler:
A flow theory for the dichromatic number. 160-167 - Carlos Hoppen, Hanno Lefmann, Knut Odermann:
On graphs with a large number of edge-colorings avoiding a rainbow triangle. 168-190 - Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. 191-234 - Nina Kamcev, Benny Sudakov, Jan Volec:
Bounded colorings of multipartite graphs and hypergraphs. 235-249 - Robert Morris:
Bootstrap percolation, and other automata. 250-263 - Luke Postle:
On the minimum number of edges in triangle-free 5-critical graphs. 264-280 - Juanjo Rué, Oriol Serra, Lluís Vena:
Counting configuration-free sets in groups. 281-307
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-09 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
