OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Combinatorial Theory Series B is 4. 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 2020-11-01 to 2024-11-01.)

Article	Citations
Edge-transitive bi-Cayley graphs	26
Generalized Turán problems for even cycles	25
The 1–2–3 Conjecture almost holds for regular graphs	20
Planar graphs that need four pages	19
Towards tight(er) bounds for the Excluded Grid Theorem	17
The Erdős Matching Conjecture and concentration inequalities	16
Extremal graphs for edge blow-up of graphs	14
A Harary-Sachs theorem for hypergraphs	14
The Alon-Tarsi number of a planar graph minus a matching	14
Colouring graphs with sparse neighbourhoods: Bounds and applications	13
The multicolour size-Ramsey number of powers of paths	11
Decompositions into isomorphic rainbow spanning trees	10
Constructions of new q-cryptomorphisms	10
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	10
On the rational Turán exponents conjecture	10
The evolution of the structure of ABC-minimal trees	10
Subdivisions of digraphs in tournaments	9
On a conjecture of spectral extremal problems	9
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five	9
Grid induced minor theorem for graphs of small degree	9
Graph product structure for non-minor-closed classes	8
Clique immersion in graphs without a fixed bipartite graph	8
K-factors in graphs with low independence number	8
Reconfiguring colorings of graphs with bounded maximum average degree	8
Completion and deficiency problems	8

Canonical trees of tree-decompositions	8
Most Laplacian eigenvalues of a tree are small	8
The feasible region of hypergraphs	7
Clustered variants of Hajós' conjecture	7
Graph functionality	7
The inverse Kazhdan-Lusztig polynomial of a matroid	7
A scaling limit for the length of the longest cycle in a sparse random graph	7
Regular Cayley maps for dihedral groups	7
On the cop number of toroidal graphs	7
The structure of hypergraphs without long Berge cycles	7
Total weight choosability of graphs: Towards the 1-2-3-conjecture	7
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	7
Density of C−4-critical signed graphs	7
Connectivity and choosability of graphs with no K minor	7
Approximating infinite graphs by normal trees	7
Dichromatic number and forced subdivisions	7
Cubic graphs that cannot be covered with four perfect matchings	6
Turán problems for edge-ordered graphs	6
Spanning trees in dense directed graphs	6
An average degree condition for independent transversals	6
Erdős-Pósa property of chordless cycles and its applications	6
A polynomial version of Cereceda's conjecture	6
Minimum degree conditions for monochromatic cycle partitioning	6
On the lower bound of the sum of the algebraic connectivity of a graph and its complement	6
Circular flows via extended Tutte orientations	6
Disjoint isomorphic balanced clique subdivisions	6
The Grid Theorem for vertex-minors	6
On Hamiltonian cycles in hypergraphs with dense link graphs	6
Tilings in vertex ordered graphs	5
The (theta, wheel)-free graphs Part IV: Induced paths and cycles	5
On edge-primitive 3-arc-transitive graphs	5
How to build a pillar: A proof of Thomassen's conjecture	5
Obstructions for bounded shrub-depth and rank-depth	5
Stability for vertex isoperimetry in the cube	5
An asymptotic resolution of a problem of Plesník	5
Bounding χ by a fraction of Δ for graphs without large cliques	5
The Turán number of blow-ups of trees	5
Flows on flow-admissible signed graphs	5
Relatively small counterexamples to Hedetniemi's conjecture	5
Polynomial bounds for centered colorings on proper minor-closed graph classes	5
Even-hole-free graphs still have bisimplicial vertices	5
Jumps in speeds of hereditary properties in finite relational languages	5
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	5
Super-pancyclic hypergraphs and bipartite graphs	5
Sparse hypergraphs: New bounds and constructions	5
On the spectral gap and the automorphism group of distance-regular graphs	5
Every nice graph is (1,5)-choosable	5
Induced subgraphs of graphs with large chromatic number. VI. Banana trees	5
A lower bound on the average size of a connected vertex set of a graph	5
Progress towards Nash-Williams' conjecture on triangle decompositions	5

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
Evaluations of Tutte polynomials of regular graphs	4
Gaps in the cycle spectrum of 3-connected cubic planar graphs	4
Canonical double covers of circulants	4
A new bound for the Brown–Erdős–Sós problem	4
Immersion and clustered coloring	4
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	4
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs	4
The multicolor size-Ramsey numbers of cycles	4
A proof of the upper matching conjecture for large graphs	4
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true	4
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture	4
Dirac-type theorems in random hypergraphs	4
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs	4
A unified existence theorem for normal spanning trees	4
Tangles and the Stone-Čech compactification of infinite graphs	4
Topological ubiquity of trees	4
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	4
A solution to the 1-2-3 conjecture	4
The Farey graph is uniquely determined by its connectivity	4
Edge-critical subgraphs of Schrijver graphs II: The general case	4
Many cliques with few edges and bounded maximum degree	4
A unified approach to hypergraph stability	4
Embedding clique-factors in graphs with low ℓ-independence number	4