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 2021-07-01 to 2025-07-01.)
ArticleCitations
Coloring circle arrangements: New 4-chromatic planar graphs41
A characterization of positroids, with applications to amalgams and excluded minors29
Packing and covering directed triangles asymptotically27
Pendant appearances and components in random graphs from structured classes19
The extensible No-Three-In-Line problem15
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers15
The Alon–Tarsi number of a toroidal grid14
An algebraic approach for counting DP-3-colorings of sparse graphs14
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović14
Clique immersions and independence number12
Degree conditions for Ramsey goodness of paths10
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula9
Skew key polynomials and a generalized Littlewood–Richardson rule8
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors8
Subdivisions in dicritical digraphs with large order or digirth8
An identity of Ramanujan and its combinatorics8
On Hankel determinants for Dyck paths with peaks avoiding multiple classes of heights8
A duality theorem for the ic-resurgence of edge ideals8
Corrigendum to “Orientably-regular maps of Euler characteristic 7
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation7
Rainbow clique subdivisions7
A note on non-empty cross-intersecting families7
Walks avoiding a quadrant and the reflection principle7
On the size of (K7
Continuously increasing subsequences of random multiset permutations6
Rainbow connectivity and rainbow index of inhomogeneous random graphs6
Stability theorems for some Kruskal–Katona type results6
Editorial Board6
Editorial Board6
Rectangulotopes6
Almost orthogonal subsets of vector spaces over finite fields6
Induced Turán problems and traces of hypergraphs6
On the maximum number of common neighbours in dense random regular graphs6
A new bound for the Maker–Breaker triangle game6
Parity biases in partitions and restricted partitions5
On the restricted sumsets containing powers of an integer5
Fundamental quasisymmetric functions in superspace5
Clustered coloring of graphs with bounded layered treewidth and bounded degree5
Editorial Board5
Minimum degree ensuring that a hypergraph is hamiltonian-connected5
Improved bounds for the dimension of divisibility5
Polynomial bounds for chromatic number VI. Adding a four-vertex path5
Improved upper bound on the Frank number of 3-edge-connected graphs5
Shape of the asymptotic maximum sum-free sets in integer lattice grids5
Stanley–Wilf limits for patterns in rooted labeled forests5
Distinguishing index of graphs with simple automorphism groups4
Editorial Board4
Reprint of: Precoloring extension in planar near-Eulerian-triangulations4
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem4
Hardness of the generalized coloring numbers4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials4
P-strict promotion and 4
Sum-distinguishing number of sparse hypergraphs4
Crystal pop-stack sorting and type A crystal lattices4
Characterizations of families of morphisms and words via binomial complexities4
When removing an independent set is optimal for reducing the chromatic number4
On sum-intersecting families of positive integers4
Transducing paths in graph classes with unbounded shrubdepth4
Dual Ramsey properties for classes of algebras4
Some snarks are worse than others4
On the spectrum and linear programming bound for hypergraphs4
Finding strong components using depth-first search4
Induced subdivisions with pinned branch vertices4
Guarding isometric subgraphs and cops and robber in planar graphs4
Clique covers of H-free graphs4
The structure of large non-trivial t-intersecting families of finite s4
Coloring zonotopal quadrangulations of the projective space4
Choosing between incompatible ideals4
When all directed cycles have length three4
Intersection theorems for (4
Approximating fractionally isomorphic graphons4
Primitive elements of the Hopf algebras of tableaux3
Terrain-like graphs and the median Genocchi numbers3
The rotation distance of brooms3
Non-existence of two infinite families of strongly regular graphs3
Wachs permutations, Bruhat order and weak order3
Kalai’s conjecture in r-partite 3
Binomial determinants for tiling problems yield to the holonomic ansatz3
Asymmetric edge-colorings of graphs with three colors3
Comparing width parameters on graph classes3
Partitioning the projective plane and the dunce hat3
Enumeration of standard barely set-valued tableaux of shifted shapes3
Almost unimodal and real-rooted graph polynomials3
Separating rank 3 graphs3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra3
Spanning subdivisions in dense digraphs3
Generalized Turán problem for a path and a clique3
Minors, connectivity, and diameter in randomly perturbed sparse graphs3
Editorial Board3
Thresholds for constrained Ramsey and anti-Ramsey problems3
Improved bounds on the Ramsey number of fans3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes3
Factor-of-iid balanced orientation of non-amenable graphs3
When (signless) Laplacian coefficients meet matchings of subdivision3
Spanning hypertrees, vertex tours and meanders3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics3
On the Δ-edge stability number of graphs3
The (k,l)<3
List-recoloring of sparse graphs3
MSO undecidability for hereditary classes of unbounded clique-width3
Parametric restrictions on quasi-symmetric designs3
Stack and queue numbers of graphs revisited3
The sum of all width-one matrices3
Zero sum cycles in complete digraphs2
The spectral radius of graphs with no odd wheels2
Dense sumsets of Sidon sequences2
Editorial Board2
Strong edge coloring of circle graphs2
Weak diameter coloring of graphs on surfaces2
Polynomials related to q-analog of the generalized derivative polynomi2
Decomposing a triangle-free planar graph into a forest and a subcubic forest2
Spined categories: Generalizing tree-width beyond graphs2
Constructing sparsest -hamiltonian saturated 2
Ramsey goodness of k-uniform paths, or the lack thereof2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole2
The permuto-associahedron revisited2
Editorial Board2
Real stable polynomials and the alternatingly increasing property2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish2
Minimum degree conditions for containing an r-regular 2
Hamiltonicity in Cherry-quasirandom 3-graphs2
Partition and Cohen–Macaulay extenders2
Building graphs with high minimum degree on a budget2
Online coloring of short intervals2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs2
Coloring graphs by translates in the circle2
Waiter–Client triangle-factor game on the edges of the complete graph2
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment2
Generalizing Körner’s graph entropy to graphons2
Intersections and distinct intersections in cross-intersecting families2
Signed Mahonian polynomials on derangements in classical Weyl groups2
Editorial Board2
Counting deranged matchings2
The semi-random tree process2
Minimally globally rigid graphs2
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal2
The Terwilliger algebra of the halved n-cube from the viewpoint of it2
On degree powers and counting stars in F-free graphs2
A polynomial upper bound for poset saturation2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory2
Maximizing five-cycles in Kr2
Quasi-random words and limits of word sequences2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree2
Characteristic sets of matroids2
Deformation cones of graph associahedra and nestohedra2
The Frank number and nowhere-zero flows on graphs2
Properly colored short cycles in edge-colored graphs2
High dimensional expanders and coset geometries2
Boundary rigidity of 3D CAT(0) cube complexes2
Number of A+2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl2
Partial geometric designs arising from association schemes2
Preface2
Stable sets in flag spheres2
Improved bounds on the maximum diversity of intersecting families2
On the order of semiregular automorphisms of cubic vertex-transitive graphs2
Large Y3,2
High-dimensional expanders from Kac–Moody–Steinberg groups2
On k-neighborly reorientations of oriented matroids2
Kempe changes in degenerate graphs2
Editorial Board2
Partitioning a 2-edge-coloured graph of minimum degree 2n2
Descents on nonnesting multipermutations2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths2
Stability of extremal connected hypergraphs avoiding Berge-paths2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph2
Ramsey numbers of cliques versus monotone paths2
The Weighted Davenport constant of a group and a related extremal problem-II2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent2
Deletion–contraction and the surface Tutte polynomial2
On colourability of polygon visibility graphs2
0.031156063079834