European Journal of Combinatorics

Article	Citations
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs	28
The spectral radius of graphs with no odd wheels	22
Homomorphisms of signed graphs: An update	22
Injective edge-coloring of graphs with given maximum degree	19
General lemmas for Berge–Turán hypergraph problems	18
On subgroup perfect codes in Cayley graphs	13
A deletion–contraction relation for the chromatic symmetric function	12
On the asymptotic growth of the number of tree-child networks	12
Generalized spectral characterizations of almost controllable graphs	12
Partial duality for ribbon graphs, I: Distributions	11
On the 4-color theorem for signed graphs	11
Lattice paths and branched continued fractions II. Multivariate Lah polynomials and Lah symmetric functions	11
Concepts of signed graph coloring	10
Tree-width dichotomy	10
New truncated theorems for three classical theta function identities	10
A tight lower bound on the matching number of graphs via Laplacian eigenvalues	9
Snake graphs and continued fractions	9
On the tree-width of even-hole-free graphs	9
Proof of a conjecture on the Seidel energy of graphs	9
A half-normal distribution scheme for generating functions	8
Uniformity thresholds for the asymptotic size of extremal Berge-F-fr	8
Some exact results for generalized Turán problems	8
Branch-depth: Generalizing tree-depth of graphs	7
Optimal radio-k-labelings of trees	7
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth	7

2-universality in randomly perturbed graphs	7
Toughness in pseudo-random graphs	7
On12	7
On the maximum mean subtree order of trees	7
On λ-fold relative Heffter arrays and biembedding multigraphs on surfa	7
Corrigendum to “On subgroup perfect codes in Cayley graphs” [European J. Combin. 91 (2021) 103228]	6
Rainbow Turán number of clique subdivisions	6
Binomial determinants for tiling problems yield to the holonomic ansatz	6
Defective DP-colorings of sparse multigraphs	6
Superposition of snarks revisited	6
On graphs whose second largest eigenvalue is at most 1	6
r-hued	6
A bound for the distinguishing index of regular graphs	6
Cops and robbers on directed and undirected abelian Cayley graphs	6
The mixing time of switch Markov chains: A unified approach	6
Generalized Jacobi–Trudi determinants and evaluations of Schur multiple zeta values	6
Sharp results concerning disjoint cross-intersecting families	6
The structure of large non-trivial t-intersecting families of finite s	6
Fertility monotonicity and average complexity of the stack-sorting map	6
Counterexamples to a conjecture by Gross, Mansour and Tucker on partial-dual genus polynomials of ribbon graphs	5
Lovász–Saks–Schrijver ideals and parity binomial edge ideals of graphs	5
4-connected polyhedra have at least a linear number of hamiltonian cycles	5
Independent sets, cliques, and colorings in graphons	5
On odd rainbow cycles in edge-colored graphs	5
On 2-defective DP-colorings of sparse graphs	5
Parity bias in partitions	5
Regular graphs with minimum spectral gap	5
A Tutte polynomial for maps II: The non-orientable case	5
Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations	5
Minimizing the numbers of cliques and cycles of fixed size in an F-sa	5
Odd decompositions and coverings of graphs	5
Extremal problems in uniformly dense hypergraphs	5
Partitions of matrix spaces with an application to q-rook polynomials	5
On difference graphs and the local dimension of posets	5
A Thomassen-type method for planar graph recoloring	5
On a conjecture of Gross, Mansour and Tucker	5
On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs	5
Alternating multiple zeta values, and explicit formulas of some Euler–Apéry-type series	4
On maximum intersecting sets in direct and wreath product of groups	4
On the Baer–Lovász–Tutte construction of groups from graphs: Isomorphism types and homomorphism notions	4
On-line partitioning of width w posets into 4
On tilings of asymmetric limited-magnitude balls	4
Principal specializations of Schubert polynomials and pattern containment	4
Fundamental polytopes of metric trees via parallel connections of matroids	4
An improved condition for a graph to be determined by its generalized spectrum	4
Old and new applications of Katona’s circle	4
Edge-ordered Ramsey numbers	4
New bounds for distance-type problems over prime fields	4
Minimally globally rigid graphs	4
The generalized Delta conjecture att	4

On the upward book thickness problem: Combinatorial and complexity results	4
The oriented size Ramsey number of directed paths	4
A linear hypergraph extension of the bipartite Turán problem	4
Decomposing and colouring some locally semicomplete digraphs	4
Connected hypergraphs without long Berge-paths	4
Pseudo sunflowers	4
Colouring of S-labelled planar graphs	4
Schröder combinatorics and ν-associahedra	4
On symmetric intersecting families	4
Incongruent equipartitions of the plane	4
A billiards-like dynamical system for attacking chess pieces	4
Generalised voltage graphs	3
On the chromatic vertex stability number of graphs	3
Counting primitive subsets and other statistics of the divisor graph of {	3
Cutoff on graphs and the Sarnak–Xue density of eigenvalues	3
Finite 3-set-homogeneous graphs	3
On the γ-positivity of multiset Eulerian polynomials	3
On the distribution of runners on a circle	3
Finding strongly popular b-matchings in bipartite graphs	3
Transport of patterns by Burge transpose	3
Deformation cones of graph associahedra and nestohedra	3
Remarks on the Erdős Matching Conjecture for vector spaces	3
Flagged (P,	3
Distribution of colors in Gallai colorings	3
No additional tournaments are quasirandom-forcing	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
Maximizing five-cycles in Kr	3
Kernelization and approximation of distance-r independent sets on	3
0-Hecke modules for Young row-strict quasisymmetric Schur functions	3
A structural characterisation of Av(1324) and new bounds on its growth rate	3
Ubiquity and the Farey graph	3
Finite type invariants for knotoids	3
Combinatorics of Bousquet-Mélou–Schaeffer numbers in the light of topological recursion	3
Decomposing a triangle-free planar graph into a forest and a subcubic forest	3
Characterizations of line graphs in signed and gain graphs	3
Reconfiguring graph homomorphisms on the sphere	3
Distance-two colourings of Barnette graphs	3
Stable structure on safe set problems in vertex-weighted graphs	3
Parity biases in partitions and restricted partitions	3
Ramsey degrees: Big v. small	3
Properly colored short cycles in edge-colored graphs	3
Saturation problems in the Ramsey theory of graphs, posets and point sets	3
Zonotopes whose cellular strings are all coherent	3
Uniform orderings for generalized coloring numbers	3
Bijective proofs of recurrences involving two Schröder triangles	3
Linear Turán numbers of acyclic triple systems	3
Connectivity of orientations of 3-edge-connected graphs	3
A bijective proof and generalization of Siladić’s Theorem	2
Toughness, hamiltonicity and spectral radius in graphs	2
Partial geometric designs arising from association schemes	2
1/2-conjecture	2
Analogues of Milner’s Theorem for families without long chains and of vector spaces	2
An improved universal bound for t-intersecting families	2
Combinatorial study of graphs arising from the Sachdev–Ye–Kitaev model	2
Orientably-regular maps of Euler characteristic −2	2
Block decomposition and statistics arising from permutation tableaux	2
Tournaments and the strong Erdős–Hajnal Property	2
Integer sets with identical representation functions, II	2
Beyond the Erdős Matching Conjecture	2
On the product dimension of clique factors	2
Long directed rainbow cycles and rainbow spanning trees	2
On the roots of the subtree polynomial	2
On saturation of Berge hypergraphs	2
Packing A-paths of length zero modulo four	2
An analogue of the Erdős–Gallai theorem for random graphs	2
A note on the uniformity threshold for Berge hypergraphs	2
Jacobian elliptic functions and a family of bivariate peak polynomials	2
On 3-flow-critical graphs	2
Tilings in graphons	2
Burling graphs revisited, part I: New characterizations	2
From the 1-2-3 conjecture to the Riemann hypothesis	2
Reconstructing a generalized quadrangle from the Penttila–Williford 4-	2
New short proofs to some stability theorems	2
VC-saturated set systems	2
Clique immersions and independence number	2
On the structure of cube tiling codes	2
Zero sum cycles in complete digraphs	2
On an approach for evaluating certain trigonometric character sums using the discrete time heat kernel	2
Metric dimension of critical Galton–Watson trees and linear preferential attachment trees	2
Two-arc-transitive graphs of odd order — II	2

On-line size Ramsey number for monotone k-uniform ordered paths with	2
Weak saturation stability	2
Improved bounds on the Ramsey number of fans	2
Decomposable polymatroids and connections with graph coloring	2
Turán numbers for hypergraph star forests	2
Rank connectivity and pivot-minors of graphs	2
Probabilistic zero forcing on random graphs	2
A new bound for the Maker–Breaker triangle game	2
Representations of torsion-free arithmetic matroids	2
Hook, line and sinker: A bijective proof of the skew shifted hook-length formula	2
On the chromatic number of two generalized Kneser graphs	2
Graph covers with two new eigenvalues	2
Planar graph with twin-width seven	2
Small rainbow cliques in randomly perturbed dense graphs	2
Distinguishing index of graphs with simple automorphism groups	2
Hamilton cycles in the semi-random graph process	2
P-partition power sums	2
Corners and simpliciality in oriented matroids and partial cubes	2
Counting cliques in 1-planar graphs	2
An improved linear connectivity bound for tournaments to be highly linked	2
Localized versions of extremal problems	2
On Rado conditions for nonlinear Diophantine equations	2
The average cut-rank of graphs	2
On bipartite graphs with exactly one irreducible T-module with endpo	2
Gallai–Ramsey number of odd cycles with chords	2
List-recoloring of sparse graphs	2
Intersections and distinct intersections in cross-intersecting families	2
Cyclic coloring of plane graphs with maximum face size 16 and 17	2
Packing branchings under cardinality constraints on their root sets	2
Distance r-domination number and 2
Irreducible 4-critical triangle-free toroidal graphs	2
Strongly even cycle decomposable 4-regular line graphs	2
A bijective proof of the hook-length formula for skew shapes	2
On the critical values in subset sum	2
Lonesum and Γ-free 2
The Haglund–Remmel–Wilson identity for k-Stirling permutations	2
Clustered coloring of graphs with bounded layered treewidth and bounded degree	2
On the classification of binary completely transitive codes with almost-simple top-group	2
2-connected chordal graphs and line graphs are (1	2
Polynomial bounds for chromatic number VI. Adding a four-vertex path	2