default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 59
Volume 59, January 2017
- Carl Feghali, Matthew Johnson
, Daniël Paulusma:
Kempe equivalence of colourings of cubic graphs. 1-10 - Peter Danziger, Eric Mendelsohn, Tommaso Traetta:
On the existence of unparalleled even cycle systems. 11-22 - Iain Moffatt, Eunice Mphako-Banda:
Handle slides for delta-matroids. 23-33 - Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Bounds on the game transversal number in hypergraphs. 34-50 - David Rolnick:
On the classification of Stanley sequences. 51-70 - Andrew Elvey Price, Anthony J. Guttmann:
Permutations sortable by deques and by two stacks in parallel. 71-95 - Bojan Mohar, Petr Skoda:
Obstructions for two-vertex alternating embeddings of graphs in surfaces. 96-113 - Robin D. P. Zhou, Sherry H. F. Yan:
The Raney numbers and (s, s+1)-core partitions. 114-121 - Hidefumi Ohsugi, Takayuki Hibi:
A Gröbner basis characterization for chordal comparability graphs. 122-128 - Henning Bruhn, Oliver Schaudt:
The union-closed sets conjecture almost holds for almost all random bipartite graphs. 129-149 - Frantisek Kardos, Daniel Král', Anita Liebenau, Lukás Mach:
First order convergence of matroids. 150-168 - Mateusz Michalek:
Finite phylogenetic complexity of Zp and invariants for Z3. 169-186 - Michel Surmacs:
Improved bound on the oriented diameter of graphs with given minimum degree. 187-191 - Matthieu Jacquemet:
On hyperbolic Coxeter n-cubes. 192-203 - Jianxin Wei:
The structures of bad words. 204-214
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 2024-09-30 20:47 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:
