OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Combinatorial Theory Series B is 3. 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 2021-04-01 to 2025-04-01.)

Article	Citations
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	18
A weak box-perfect graph theorem	17
Editorial Board	14
Editorial Board	14
A new bound for the Brown–Erdős–Sós problem	13
On the spectrum of Hamiltonian cycles in the n-cube	13
Editorial Board	11
The binary matroids with no odd circuits of size exceeding five	11
Sharp bounds for the chromatic number of random Kneser graphs	10
Treewidth versus clique number. II. Tree-independence number	10
Intersecting families of sets are typically trivial	10
The Farey graph is uniquely determined by its connectivity	10
On orders of automorphisms of vertex-transitive graphs	10
A localization method in Hamiltonian graph theory	10
Rooted topological minors on four vertices	8
Dirac-type conditions for spanning bounded-degree hypertrees	8
k-apices of minor-closed graph classes. I. Bounding the obstructions	8
On the intersection conjecture for infinite trees of matroids	8
Bounding χ by a fraction of Δ for graphs without large cliques	8
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	8
Colouring graphs with sparse neighbourhoods: Bounds and applications	8
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	8
Linkages and removable paths avoiding vertices	8
On a recolouring version of Hadwiger's conjecture	8
Efficiently distinguishing all tangles in locally finite graphs	8

Entanglements	7
On 2-cycles of graphs	7
A fast distributed algorithm for (Δ + 1)-edge-coloring	7
On the use of senders for asymmetric tuples of cliques in Ramsey theory	7
Spanning trees in dense directed graphs	7
Overfullness of critical class 2 graphs with a small core degree	7
Dichromatic number and forced subdivisions	7
Decomposing hypergraphs into cycle factors	7
On the Cayleyness of Praeger-Xu graphs	7
Characterising k-connected sets in infinite graphs	6
Hamiltonian cycles and 1-factors in 5-regular graphs	6
Dirac-type theorems in random hypergraphs	6
The feasible region of induced graphs	6
Finite matchability under the matroidal Hall's condition	6
Nowhere-zero 3-flows in toroidal graphs	6
Hamilton cycles in dense regular digraphs and oriented graphs	6
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	6
A scaling limit for the length of the longest cycle in a sparse random graph	5
Local 2-separators	5
Erdős-Szekeres type theorems for ordered uniform matchings	5
Graphs with all holes the same length	5
Generalized cut trees for edge-connectivity	5
Excluding a planar matching minor in bipartite graphs	5
Counting colorings of triangle-free graphs	5
Sparse graphs without long induced paths	5
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
Counting cycles in planar triangulations	5
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	5
Directed cycles with zero weight in Z	5
Turán numbers of r-graphs on r + 1 vertices	5
Concentration of maximum degree in random planar graphs	5
Kruskal–Katona-type problems via the entropy method	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
Editorial Board	4
Editorial Board	4
Editorial Board	4
Counting r-graphs without forbidden configurations	4
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	4
Approximating infinite graphs by normal trees	4
A simple proof of the Map Color Theorem for nonorientable surfaces	4
An extremal problem motivated by triangle-free strongly regular graphs	4
An explicit characterization of arc-transitive circulants	4
Editorial Board	4
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture	4
Jordan-like characterization of automorphism groups of planar graphs	4
Extremal problems for multigraphs	4
The minimum number of clique-saturating edges	4
Characterization of 4-critical triangle-free toroidal graphs	4
End spaces and tree-decompositions	4
Editorial Board	4

Embedding connected factorizations	4
Jumps in speeds of hereditary properties in finite relational languages	4
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	4
Trees with many leaves in tournaments	3
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	3
Cycle decompositions in k-uniform hypergraphs	3
Quantum isomorphism of graphs from association schemes	3
The structure of hypergraphs without long Berge cycles	3
The multicolor size-Ramsey numbers of cycles	3
A polynomial version of Cereceda's conjecture	3
Graphs with polynomially many minimal separators	3
On sensitivity in bipartite Cayley graphs	3
Minimal asymmetric hypergraphs	3
Clique immersion in graphs without a fixed bipartite graph	3
The Grid Theorem for vertex-minors	3
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	3
The minimum degree removal lemma thresholds	3
Dimension is polynomial in height for posets with planar cover graphs	3
Enlarging vertex-flames in countable digraphs	3
Cancellative hypergraphs and Steiner triple systems	3
Erdős-Hajnal for cap-free graphs	3
Random homomorphisms into the orthogonality graph	3