default search action
European Journal of Combinatorics, Volume 61
Volume 61, March 2017
- Jesper M. Møller:
Equivariant Euler characteristics of partition posets. 1-24 - Darren B. Glass:
Critical groups of graphs with dihedral actions II. 25-46 - Huda Chuangpishit, Mahya Ghandehari, Jeannette C. M. Janssen:
Uniform linear embeddings of graphons. 47-68 - Wenjie Fang, Louis-François Préville-Ratelle:
The enumeration of generalized Tamari intervals. 69-84 - Hiroshi Maehara, Horst Martini:
Separating n-point sets from quasi-finite ones via polyhedral surfaces. 85-90 - Nevena Francetic, Sarada Herke, Brendan D. McKay, Ian M. Wanless:
On Ryser's conjecture for linear intersecting multipartite hypergraphs. 91-105 - Mathias Pétréolle:
Characterization of cyclically fully commutative elements in finite and affine Coxeter groups. 106-132 - Bhaskar Bagchi, Basudeb Datta, Jonathan Spreer:
A characterization of tightly triangulated 3-manifolds. 133-137 - Tom Kelly, Chun-Hung Liu:
Minimum size of feedback vertex sets of planar graphs of girth at least five. 138-150 - Fabrizio Caselli, Mario Marietti:
Special matchings in Coxeter groups. 151-166 - Matt DeVos, Daryl Funk, Irene Pivotto:
On excluded minors of connectivity 2 for the class of frame matroids. 167-196 - Nickolas Hein, Jia Huang:
Modular Catalan numbers. 197-218 - Payam Valadkhan:
The complexity of list edge-partitions for simple graphs. 219-234 - Pablo Spiga, Gabriel Verret:
Vertex-primitive digraphs having vertices with almost equal neighbourhoods. 235-241 - Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, Lucien Pech:
Hypergeometric expressions for generating functions of walks with small steps in the quarter plane. 242-275 - Dmitry N. Kozlov:
All binomial identities are orderable. 276-281
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.