default search action
European Journal of Combinatorics, Volume 54
Volume 54, May 2016
- Per Alexandersson:
Gelfand-Tsetlin polytopes and the integer decomposition property. 1-20 - Przemyslaw Wenus, Krzysztof Wesek:
Nonrepetitive and pattern-free colorings of the plane. 21-34 - Ming Han, Xuding Zhu:
Locally planar graphs are 2-defective 4-paintable. 35-50 - Denis S. Krotov, Vladimir N. Potapov:
Constructions of transitive latin hypercubes. 51-64 - Ricky Ini Liu:
On the commutative quotient of Fomin-Kirillov algebras. 65-75 - Dein Wong, Xiaobin Ma, Fenglei Tian:
Relation between the skew-rank of an oriented graph and the rank of its underlying graph. 76-86 - Emma Yu Jin:
Heaps and two exponential structures. 87-102 - Bhaskar Bagchi, Basudeb Datta, Jonathan Spreer:
Tight triangulations of closed 3-manifolds. 103-120 - Marilena Barnabei, Niccolò Castronuovo:
The Schützenberger involution over Dyck paths. 121-137 - Joanna N. Chen, William Y. C. Chen:
On permutations with bounded drop size. 138-153 - Rudi Mrazovic:
Extractors in Paley graphs: A random model. 154-162 - Joel Moreira, Florian Karl Richter:
Large subsets of discrete hypersurfaces in contain arbitrarily many collinear points. 163-176 - Marston D. E. Conder, Arjana Zitnik:
Half-arc-transitive graphs of arbitrary even valency greater than 2. 177-186 - Takayuki Hibi, Kazunori Matsuda:
Quadratic Gröbner bases of twinned order polytopes. 187-192 - Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang:
Rainbow cliques in edge-colored graphs. 193-200 - Yong-Gao Chen, Min Tang:
On a generalization of a theorem of Sárközy and Sós. 201-206 - Hana Kim, Richard P. Stanley:
A refined enumeration of hex trees and related polynomials. 207-219 - Karin Baur, Mark J. Parsons, Manuela Tschabold:
Infinite friezes. 220-237
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.