European Journal of Combinatorics

Article	Citations
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs	33
The spectral radius of graphs with no odd wheels	27
Homomorphisms of signed graphs: An update	24
Injective edge-coloring of graphs with given maximum degree	23
On subgroup perfect codes in Cayley graphs	17
New truncated theorems for three classical theta function identities	15
On the asymptotic growth of the number of tree-child networks	13
Generalized spectral characterizations of almost controllable graphs	13
Tree-width dichotomy	13
On the 4-color theorem for signed graphs	12
Lattice paths and branched continued fractions II. Multivariate Lah polynomials and Lah symmetric functions	12
A tight lower bound on the matching number of graphs via Laplacian eigenvalues	12
On the tree-width of even-hole-free graphs	11
On the maximum mean subtree order of trees	10
Concepts of signed graph coloring	10
The mixing time of switch Markov chains: A unified approach	10
Some exact results for generalized Turán problems	10
Toughness in pseudo-random graphs	8
On12	8
Binomial determinants for tiling problems yield to the holonomic ansatz	7
Optimal radio-k-labelings of trees	7
Superposition of snarks revisited	7
On graphs whose second largest eigenvalue is at most 1	7
Branch-depth: Generalizing tree-depth of graphs	7
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth	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]	7
Rainbow Turán number of clique subdivisions	7
Fertility monotonicity and average complexity of the stack-sorting map	7
Regular graphs with minimum spectral gap	7
On odd rainbow cycles in edge-colored graphs	6
Defective DP-colorings of sparse multigraphs	6
Minimally globally rigid graphs	6
Cops and robbers on directed and undirected abelian Cayley graphs	6
A Thomassen-type method for planar graph recoloring	6
The structure of large non-trivial t-intersecting families of finite s	6
Lovász–Saks–Schrijver ideals and parity binomial edge ideals of graphs	5
Decomposing and colouring some locally semicomplete digraphs	5
Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations	5
Deformation cones of graph associahedra and nestohedra	5
On a conjecture of Gross, Mansour and Tucker	5
On 2-defective DP-colorings of sparse graphs	5
Transport of patterns by Burge transpose	5
Alternating multiple zeta values, and explicit formulas of some Euler–Apéry-type series	5
Toughness, hamiltonicity and spectral radius in graphs	5
Connected hypergraphs without long Berge-paths	5
Finite type invariants for knotoids	5
On the Baer–Lovász–Tutte construction of groups from graphs: Isomorphism types and homomorphism notions	5
Minimizing the numbers of cliques and cycles of fixed size in an F-sa	5
Counterexamples to a conjecture by Gross, Mansour and Tucker on partial-dual genus polynomials of ribbon graphs	5
A linear hypergraph extension of the bipartite Turán problem	5
r-hued	5
4-connected polyhedra have at least a linear number of hamiltonian cycles	5
Colouring of S-labelled planar graphs	5
On maximum intersecting sets in direct and wreath product of groups	5
Odd decompositions and coverings of graphs	5
On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs	5
Principal specializations of Schubert polynomials and pattern containment	4
Ramsey degrees: Big v. small	4
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	4
Integer sets with identical representation functions, II	4
0-Hecke modules for Young row-strict quasisymmetric Schur functions	4
Combinatorics of Bousquet-Mélou–Schaeffer numbers in the light of topological recursion	4
On-line partitioning of width w posets into 4
Maximizing five-cycles in Kr	4
On the upward book thickness problem: Combinatorial and complexity results	4
Kernelization and approximation of distance-r independent sets on	4
On the γ-positivity of multiset Eulerian polynomials	4
Zonotopes whose cellular strings are all coherent	4
An improved condition for a graph to be determined by its generalized spectrum	4
Pseudo sunflowers	4
On tilings of asymmetric limited-magnitude balls	4
Turán numbers for hypergraph star forests	4
Counting substructures and eigenvalues I: Triangles	4
A billiards-like dynamical system for attacking chess pieces	4

Finite 3-set-homogeneous graphs	4
Ubiquity and the Farey graph	4
Old and new applications of Katona’s circle	4
Distance-two colourings of Barnette graphs	4
Schröder combinatorics and ν-associahedra	4
Decomposing a triangle-free planar graph into a forest and a subcubic forest	3
No additional tournaments are quasirandom-forcing	3
On bipartite graphs with exactly one irreducible T-module with endpo	3
1/2-conjecture	3
Uniform orderings for generalized coloring numbers	3
Zero sum cycles in complete digraphs	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
Hamilton cycles in the semi-random graph process	3
Saturation problems in the Ramsey theory of graphs, posets and point sets	3
Linear Turán numbers of acyclic triple systems	3
Generalised voltage graphs	3
On the chromatic vertex stability number of graphs	3
Polynomial bounds for chromatic number VI. Adding a four-vertex path	3
Parity biases in partitions and restricted partitions	3
Extremal graphs of the pth power of paths	3
On-line size Ramsey number for monotone k-uniform ordered paths with	3
Stable structure on safe set problems in vertex-weighted graphs	3
The domination number of the graph defined by two levels of then-cube	3
Neighbourhood complexity of graphs of bounded twin-width	3
Two-arc-transitive graphs of odd order — II	3
Connectivity of orientations of 3-edge-connected graphs	3
Characterizations of line graphs in signed and gain graphs	3
Weak saturation stability	3
Clique immersions and independence number	3
Probabilistic zero forcing on random graphs	3
Cutoff on graphs and the Sarnak–Xue density of eigenvalues	3
Counting cliques in 1-planar graphs	3
Remarks on the Erdős Matching Conjecture for vector spaces	3
Dual Ramsey properties for classes of algebras	2
Tournaments and the strong Erdős–Hajnal Property	2
Intersection theorems for (	2
Tilings in graphons	2
Ball packings for links	2
Jacobian elliptic functions and a family of bivariate peak polynomials	2
A new bound for the Maker–Breaker triangle game	2
Beyond the Erdős Matching Conjecture	2
New short proofs to some stability theorems	2
Diameter of the commutation classes graph of a permutation	2
Distinguishing index of graphs with simple automorphism groups	2
A strengthening of the Erdős–Szekeres Theorem	2
Long path and cycle decompositions of even hypercubes	2
New bounds on the maximum size of Sperner partition systems	2
Reconstructing a generalized quadrangle from the Penttila–Williford 4-	2
New bounds on the maximum number of neighborly boxes in	2
Partial geometric designs arising from association schemes	2
On generalized quadrangles with a group of automorphisms acting regularly on the point set, difference sets with	2
Corners and simpliciality in oriented matroids and partial cubes	2
Separating rank 3 graphs	2
On an approach for evaluating certain trigonometric character sums using the discrete time heat kernel	2
From the 1-2-3 conjecture to the Riemann hypothesis	2
Counting primitive subsets and other statistics of the divisor graph of {	2
VC-saturated set systems	2
Chromatic symmetric functions of Dyck paths and q-rook theory	2
Enumeration of various animals on the triangular lattice	2
The distribution of the maximum number of common neighbors in the random graph	2
3-regular graphs are 2-reconstructible	2
A note on interval colourings of graphs	2
Gallai–Ramsey number of odd cycles with chords	2
Intersections and distinct intersections in cross-intersecting families	2
On the classification of binary completely transitive codes with almost-simple top-group	2
The γ-positivity of bivariate Eulerian polynomials via the Hetyei–Re	2
Strongly even cycle decomposable 4-regular line graphs	2
On Rado conditions for nonlinear Diophantine equations	2
Burling graphs revisited, part I: New characterizations	2
On the critical values of Burr’s problem	2
Distance r-domination number and 2
On regular systems of finite classical polar spaces	2
An improved linear connectivity bound for tournaments to be highly linked	2
Localized versions of extremal problems	2
Fusion rules for pastures and tracts	2
Metric dimension of critical Galton–Watson trees and linear preferential attachment trees	2
On 3-flow-critical graphs	2
Block decomposition and statistics arising from permutation tableaux	2
2-connected chordal graphs and line graphs are (1	2
The planar Cayley graphs are effectively enumerable II	2

Improved bounds on the Ramsey number of fans	2
Chen and Chvátal’s conjecture in tournaments	2
On the chromatic number of two generalized Kneser graphs	2
The maximum number of triangles in F	2
On saturation of Berge hypergraphs	2
Splitting subspaces and a finite field interpretation of the Touchard–Riordan Formula	2
Representations of torsion-free arithmetic matroids	2
A note on the uniformity threshold for Berge hypergraphs	2
An analogue of the Erdős–Gallai theorem for random graphs	2
Graph covers with two new eigenvalues	2
Graph-codes	2
Packing A-paths of length zero modulo four	2
Digraph redicolouring	2
Rank connectivity and pivot-minors of graphs	2
Analogues of Milner’s Theorem for families without long chains and of vector spaces	2
Orientably-regular maps of Euler characteristic −2	2
P-partition power sums	2
Blowup Ramsey numbers	2
The Terwilliger algebra of the halved n-cube from the viewpoint of it	2
Properly colored short cycles in edge-colored graphs	2
The average cut-rank of graphs	2
Packing branchings under cardinality constraints on their root sets	2
Sharp spectral bounds for the edge-connectivity of regular graphs	2
List-recoloring of sparse graphs	2
Small rainbow cliques in randomly perturbed dense graphs	2
The Haglund–Remmel–Wilson identity for k-Stirling permutations	2