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-05-01 to 2024-05-01.)

Article	Citations
Edge-transitive bi-Cayley graphs	25
Generalized Turán problems for even cycles	22
The 1–2–3 Conjecture almost holds for regular graphs	19
Planar graphs that need four pages	18
Towards tight(er) bounds for the Excluded Grid Theorem	17
Colouring graphs with sparse neighbourhoods: Bounds and applications	13
The inverse eigenvalue problem of a graph: Multiplicities and minors	13
Hamiltonicity in randomly perturbed hypergraphs	13
The Erdős Matching Conjecture and concentration inequalities	12
A Harary-Sachs theorem for hypergraphs	11
The Alon-Tarsi number of a planar graph minus a matching	11
The multicolour size-Ramsey number of powers of paths	11
Towards the linear arboricity conjecture	11
The hat guessing number of graphs	10
On the rational Turán exponents conjecture	10
Cuboids, a class of clutters	9
Subdivisions of digraphs in tournaments	9
Simple k-planar graphs are simple (k + 1)-quasiplanar	9
The number of Gallai k-colorings of complete graphs	9
Extremal graphs for edge blow-up of graphs	9
Constructions of new q-cryptomorphisms	9
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	8
Completion and deficiency problems	8
Decompositions into isomorphic rainbow spanning trees	8
Clustered variants of Hajós' conjecture	7

Most Laplacian eigenvalues of a tree are small	7
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five	7
Reconfiguring colorings of graphs with bounded maximum average degree	7
On the cop number of toroidal graphs	7
The structure of hypergraphs without long Berge cycles	7
A scaling limit for the length of the longest cycle in a sparse random graph	7
Erdős-Pósa property of chordless cycles and its applications	7
Maximum degree and diversity in intersecting hypergraphs	7
Approximating infinite graphs by normal trees	7
Connectivity and choosability of graphs with no K minor	6
Total weight choosability of graphs: Towards the 1-2-3-conjecture	6
Minimum degree conditions for monochromatic cycle partitioning	6
The feasible region of hypergraphs	6
On the existence of graphical Frobenius representations and their asymptotic enumeration	6
Density of C−4-critical signed graphs	6
Cubic graphs that cannot be covered with four perfect matchings	6
Graph functionality	6
Clique immersion in graphs without a fixed bipartite graph	6
An average degree condition for independent transversals	6
Grid induced minor theorem for graphs of small degree	6
K-factors in graphs with low independence number	6
Circular flows via extended Tutte orientations	6
Relatively small counterexamples to Hedetniemi's conjecture	6
The inverse Kazhdan-Lusztig polynomial of a matroid	6
Dichromatic number and forced subdivisions	6
On Hamiltonian cycles in hypergraphs with dense link graphs	6
Canonical trees of tree-decompositions	6
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	6
Graph product structure for non-minor-closed classes	6
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs	5
Sparse hypergraphs: New bounds and constructions	5
Edge-critical subgraphs of Schrijver graphs	5
Induced subgraphs of graphs with large chromatic number. VI. Banana trees	5
On the chromatic number of disjointness graphs of curves	5
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
Flows on flow-admissible signed graphs	5
The Turán number of blow-ups of trees	5
Obstructions for bounded shrub-depth and rank-depth	5
The Grid Theorem for vertex-minors	5
A polynomial version of Cereceda's conjecture	5
On the lower bound of the sum of the algebraic connectivity of a graph and its complement	5
Regular Cayley maps for dihedral groups	5
The (theta, wheel)-free graphs Part IV: Induced paths and cycles	5
Turán problems for edge-ordered graphs	5
Stability for vertex isoperimetry in the cube	5
The evolution of the structure of ABC-minimal trees	5
Bounding χ by a fraction of Δ for graphs without large cliques	4
Even-hole-free graphs still have bisimplicial vertices	4
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs	4
Tangles and the Stone-Čech compactification of infinite graphs	4

A characterization of Johnson and Hamming graphs and proof of Babai's conjecture	4
The Kelmans-Seymour conjecture III: 3-vertices in K4	4
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies	4
The Kelmans-Seymour conjecture II: 2-Vertices in K4	4
On a conjecture of spectral extremal problems	4
A new bound for the Brown–Erdős–Sós problem	4
The Farey graph is uniquely determined by its connectivity	4
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	4
A unified existence theorem for normal spanning trees	4
Jumps in speeds of hereditary properties in finite relational languages	4
On the spectral gap and the automorphism group of distance-regular graphs	4
The Kelmans-Seymour conjecture I: Special separations	4
Polynomial bounds for centered colorings on proper minor-closed graph classes	4
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	4
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture	4
An asymptotic resolution of a problem of Plesník	4
The domination number of plane triangulations	4
A lower bound on the average size of a connected vertex set of a graph	4
Many cliques with few edges and bounded maximum degree	4
Super-pancyclic hypergraphs and bipartite graphs	4
Progress towards Nash-Williams' conjecture on triangle decompositions	4
On edge-primitive 3-arc-transitive graphs	4
The Kelmans-Seymour conjecture IV: A proof	4
Disjoint isomorphic balanced clique subdivisions	4
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	4