European Journal of Combinatorics

Papers
(The TQCC of European Journal of Combinatorics is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)
ArticleCitations
Pendant appearances and components in random graphs from structured classes53
Coloring circle arrangements: New 4-chromatic planar graphs33
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation20
Skew key polynomials and a generalized Littlewood–Richardson rule18
A note on non-empty cross-intersecting families18
Subdivisions in dicritical digraphs with large order or digirth15
An identity of Ramanujan and its combinatorics14
On the size of (K14
On minimal actions of countable groups11
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors11
The Alon–Tarsi number of a toroidal grid10
An algebraic approach for counting DP-3-colorings of sparse graphs9
On Hankel determinants for Dyck paths with peaks avoiding multiple classes of heights9
The extensible No-Three-In-Line problem9
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović9
Walks avoiding a quadrant and the reflection principle8
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers8
Corrigendum to “Orientably-regular maps of Euler characteristic 8
Quasisymmetric Schur Q-functions and peak Young quasisymmetric Schur8
Degree conditions for Ramsey goodness of paths8
Packing and covering directed triangles asymptotically8
Rainbow clique subdivisions8
Clique immersions and independence number8
A duality theorem for the ic-resurgence of edge ideals8
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula7
Polynomial bounds for chromatic number VI. Adding a four-vertex path7
On the C-diversity of intersecting 7
Continuously increasing subsequences of random multiset permutations7
A characterization of positroids, with applications to amalgams and excluded minors7
A new bound for the Maker–Breaker triangle game6
Rectangulotopes6
Editorial Board6
Stanley–Wilf limits for patterns in rooted labeled forests6
Clustered coloring of graphs with bounded layered treewidth and bounded degree6
Stability theorems for some Kruskal–Katona type results6
Induced Turán problems and traces of hypergraphs6
On the maximum number of common neighbours in dense random regular graphs6
Almost orthogonal subsets of vector spaces over finite fields6
Editorial Board6
Rainbow connectivity and rainbow index of inhomogeneous random graphs5
Fundamental quasisymmetric functions in superspace5
Improved bounds for the dimension of divisibility5
On sum-intersecting families of positive integers5
Parity biases in partitions and restricted partitions5
Editorial Board5
Improved upper bound on the Frank number of 3-edge-connected graphs5
On the restricted sumsets containing powers of an integer5
Precoloring extension in planar near-Eulerian-triangulations5
Ramsey expansions of Λ-ultrametric spaces5
Minimum degree ensuring that a hypergraph is hamiltonian-connected5
Clique covers of H-free graphs5
Shape of the asymptotic maximum sum-free sets in integer lattice grids5
P-strict promotion and 4
Partial-dual genus polynomial of graphs4
Dual Ramsey properties for classes of algebras4
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem4
MSO undecidability for hereditary classes of unbounded clique-width4
Factor-of-iid balanced orientation of non-amenable graphs4
When removing an independent set is optimal for reducing the chromatic number4
Induced subdivisions with pinned branch vertices4
Characterizations of families of morphisms and words via binomial complexities4
Editorial Board4
When all directed cycles have length three4
Coloring zonotopal quadrangulations of the projective space4
Crystal pop-stack sorting and type A crystal lattices4
Transducing paths in graph classes with unbounded shrubdepth4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials4
On the spectrum and linear programming bound for hypergraphs4
Higher q-continued fractions4
Preface4
Approximating fractionally isomorphic graphons4
List strong and list normal edge-coloring of (sub)cubic graphs4
Guarding isometric subgraphs and cops and robber in planar graphs4
Sum-distinguishing number of sparse hypergraphs4
Intersection theorems for (4
Distinguishing index of graphs with simple automorphism groups4
Finding strong components using depth-first search4
Odd-Ramsey numbers of complete bipartite graphs4
On the Δ-edge stability number of graphs3
Wachs permutations, Bruhat order and weak order3
Non-existence of two infinite families of strongly regular graphs3
The asymptotic uniform distribution of subset sums3
Parametric restrictions on quasi-symmetric designs3
Generalized Turán problem for a path and a clique3
Separating rank 3 graphs3
Some snarks are worse than others3
Editorial Board3
Enumeration of standard barely set-valued tableaux of shifted shapes3
Spanning hypertrees, vertex tours and meanders3
Almost unimodal and real-rooted graph polynomials3
Asymmetric edge-colorings of graphs with three colors3
The (k,l)<3
Stack and queue numbers of graphs revisited3
The sum of all width-one matrices3
Editorial Board3
When (signless) Laplacian coefficients meet matchings of subdivision3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics3
Binomial determinants for tiling problems yield to the holonomic ansatz3
Minors, connectivity, and diameter in randomly perturbed sparse graphs3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra3
Intersections and distinct intersections in cross-intersecting families3
Thresholds for constrained Ramsey and anti-Ramsey problems3
Terrain-like graphs and the median Genocchi numbers3
Partitioning the projective plane and the dunce hat3
Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes3
Editorial Board3
Comparing width parameters on graph classes3
Spanning subdivisions in dense digraphs3
The rotation distance of brooms3
The bunkbed conjecture is not robust to generalisation3
Hardness of the generalized coloring numbers3
Kalai’s conjecture in r-partite 3
List-recoloring of sparse graphs3
Ramsey goodness of k-uniform paths, or the lack thereof2
Editorial Board2
Stable sets in flag spheres2
Online coloring of short intervals2
Unimodality and certain bivariate formal Laurent series2
Partial geometric designs arising from association schemes2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths2
Dense sumsets of Sidon sequences2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups2
Weak diameter coloring of graphs on surfaces2
Minimum degree conditions for containing an r-regular 2
Strong edge coloring of circle graphs2
Ramsey numbers of cliques versus monotone paths2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole2
Preface2
Hamiltonicity in Cherry-quasirandom 3-graphs2
Deletion–contraction and the surface Tutte polynomial2
A polynomial upper bound for poset saturation2
Editorial Board2
Editorial Board2
Editorial Board2
Neighbourhood complexity of graphs of bounded twin-width2
On the order of semiregular automorphisms of cubic vertex-transitive graphs2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree2
A decomposition of cylindric partitions and cylindric partitions into distinct parts2
Editorial Board2
Number of A+2
Partition and Cohen–Macaulay extenders2
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal2
Stability properties for subgroups generated by return words2
Large Y3,2
Polynomials related to q-analog of the generalized derivative polynomi2
Signed Mahonian polynomials on derangements in classical Weyl groups2
Beyond the pseudoforest strong Nine Dragon Tree Theorem2
Descents on nonnesting multipermutations2
The Terwilliger algebra of the halved n-cube from the viewpoint of it2
Constructing sparsest -hamiltonian saturated 2
Improved bounds on the maximum diversity of intersecting families2
The permuto-associahedron revisited2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl2
Boundary rigidity of 3D CAT(0) cube complexes2
Growth rates of permutations with given descent or peak set2
Properly colored short cycles in edge-colored graphs2
The semi-random tree process2
Regular sequences and synchronized sequences in abstract numeration systems2
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment2
The Weighted Davenport constant of a group and a related extremal problem-II2
High-dimensional expanders from Kac–Moody–Steinberg groups2
Generating functions for fixed points of the Mullineux map2
A counterexample to the Ross–Yong conjecture for Grothendieck polynomials2
On k-neighborly reorientations of oriented matroids2
Combinatorial interpretations of truncated series from the Jacobi triple product identity2
Spined categories: Generalizing tree-width beyond graphs2
Stability of extremal connected hypergraphs avoiding Berge-paths2
On degree powers and counting stars in F-free graphs2
Minimally globally rigid graphs2
High dimensional expanders and coset geometries2
Counting deranged matchings2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph2
Characteristic sets of matroids2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory2
The Frank number and nowhere-zero flows on graphs2
Building graphs with high minimum degree on a budget2
Deformation cones of graph associahedra and nestohedra2
Decomposing a triangle-free planar graph into a forest and a subcubic forest2
1-planar unit distance graphs2
Partitioning a 2-edge-coloured graph of minimum degree 2n2
On colourability of polygon visibility graphs2
Real stable polynomials and the alternatingly increasing property2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent2
Kempe changes in degenerate graphs2
Generalizing Körner’s graph entropy to graphons2
0.15553689002991