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

Article	Citations
Edge-transitive bi-Cayley graphs	25
Generalized Turán problems for even cycles	21
The 1–2–3 Conjecture almost holds for regular graphs	18
Planar graphs that need four pages	17
Towards tight(er) bounds for the Excluded Grid Theorem	16
A refinement of choosability of graphs	13
Hamiltonicity in randomly perturbed hypergraphs	13
Towards the linear arboricity conjecture	12
The inverse eigenvalue problem of a graph: Multiplicities and minors	12
Colouring graphs with sparse neighbourhoods: Bounds and applications	12
A Harary-Sachs theorem for hypergraphs	11
The Erdős Matching Conjecture and concentration inequalities	11
The multicolour size-Ramsey number of powers of paths	11
The Alon-Tarsi number of a planar graph minus a matching	10
On the rational Turán exponents conjecture	10
Cuboids, a class of clutters	10
The hat guessing number of graphs	10
Simple k-planar graphs are simple (k + 1)-quasiplanar	9
A local epsilon version of Reed's Conjecture	9
Constructions of new q-cryptomorphisms	9
The number of Gallai k-colorings of complete graphs	9
Extremal graphs for edge blow-up of graphs	9
On Frank's conjecture on k-connected orientations	9
Subdivisions of digraphs in tournaments	8
Completion and deficiency problems	8

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

Graph product structure for non-minor-closed classes	4
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture	4
On the spectral gap and the automorphism group of distance-regular graphs	4
Regular Cayley maps for dihedral groups	4
Disjoint isomorphic balanced clique subdivisions	4
Tangles and the Stone-Čech compactification of infinite graphs	4
Progress towards Nash-Williams' conjecture on triangle decompositions	4
The Kelmans-Seymour conjecture II: 2-Vertices in K4	4
A unified existence theorem for normal spanning trees	4
An asymptotic resolution of a problem of Plesník	4
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	4
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies	4
On cubic graphical regular representations of finite simple groups	4
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	4
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture	4
The Kelmans-Seymour conjecture III: 3-vertices in K4	4
The Kelmans-Seymour conjecture I: Special separations	4
Super-pancyclic hypergraphs and bipartite graphs	4
The Farey graph is uniquely determined by its connectivity	4
On edge-primitive 3-arc-transitive graphs	4