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-02-01 to 2025-02-01.)

Article	Citations
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	20
Linkages and removable paths avoiding vertices	16
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	14
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	14
Editorial Board	13
Counting colorings of triangle-free graphs	10
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	10
3-List-coloring graphs of girth at least five on surfaces	10
Editorial Board	10
The feasible region of induced graphs	9
Characterising k-connected sets in infinite graphs	9
On the spectrum of Hamiltonian cycles in the n-cube	8
Editorial Board	8
A new bound for the Brown–Erdős–Sós problem	8
On the Cayleyness of Praeger-Xu graphs	8
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	8
A fast distributed algorithm for (Δ + 1)-edge-coloring	8
Decomposing hypergraphs into cycle factors	8
The binary matroids with no odd circuits of size exceeding five	8
Spanning trees in dense directed graphs	7
Hamiltonian cycles and 1-factors in 5-regular graphs	7
Hamilton cycles in dense regular digraphs and oriented graphs	7
On orders of automorphisms of vertex-transitive graphs	7
Concentration of maximum degree in random planar graphs	7
On the intersection conjecture for infinite trees of matroids	7

Treewidth versus clique number. II. Tree-independence number	7
Maximising the number of cycles in graphs with forbidden subgraphs	7
Overfullness of critical class 2 graphs with a small core degree	7
Sharp bounds for the chromatic number of random Kneser graphs	7
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	7
Generalized cut trees for edge-connectivity	7
Intersecting families of sets are typically trivial	7
Editorial Board	6
Rooted topological minors on four vertices	6
Bounding χ by a fraction of Δ for graphs without large cliques	6
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	6
Finite matchability under the matroidal Hall's condition	6
On 2-cycles of graphs	6
A localization method in Hamiltonian graph theory	6
A scaling limit for the length of the longest cycle in a sparse random graph	6
Dichromatic number and forced subdivisions	6
Efficiently distinguishing all tangles in locally finite graphs	5
On a recolouring version of Hadwiger's conjecture	5
k-apices of minor-closed graph classes. I. Bounding the obstructions	5
On the use of senders for asymmetric tuples of cliques in Ramsey theory	5
Kruskal–Katona-type problems via the entropy method	5
Colouring graphs with sparse neighbourhoods: Bounds and applications	5
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	5
The Farey graph is uniquely determined by its connectivity	5
Directed cycles with zero weight in Z	5
Entanglements	5
Excluding a planar matching minor in bipartite graphs	5
Graphs with all holes the same length	5
Dirac-type theorems in random hypergraphs	5
Dirac-type conditions for spanning bounded-degree hypertrees	5
A weak box-perfect graph theorem	5
Nowhere-zero 3-flows in toroidal graphs	5
Counting cycles in planar triangulations	4
The evolution of the structure of ABC-minimal trees	4
The Grid Theorem for vertex-minors	4
N-detachable pairs in 3-connected matroids II: Life in X	4
Editorial Board	4
Counting oriented trees in digraphs with large minimum semidegree	4
An oriented discrepancy version of Dirac's theorem	4
Local 2-separators	4
Stability of graph pairs	4
Dimension is polynomial in height for posets with planar cover graphs	4
The minimum degree removal lemma thresholds	4
Sparse graphs without long induced paths	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
Turán numbers of r-graphs on r + 1 vertices	4
Editorial Board	4
End spaces and tree-decompositions	4
Cycle decompositions in k-uniform hypergraphs	4
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	3

Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture	3
Quantum isomorphism of graphs from association schemes	3
Characterization of 4-critical triangle-free toroidal graphs	3
Erdős-Hajnal for cap-free graphs	3
Editorial Board	3
Embedding connected factorizations	3
Maximal matroids in weak order posets	3
Minimal asymmetric hypergraphs	3
Extremal problems for multigraphs	3
Graphs with polynomially many minimal separators	3
The inverse Kazhdan-Lusztig polynomial of a matroid	3
Editorial Board	3
An extremal problem motivated by triangle-free strongly regular graphs	3
Typical and extremal aspects of friends-and-strangers graphs	3
Editorial Board	3
Clique immersion in graphs without a fixed bipartite graph	3
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	3
Enlarging vertex-flames in countable digraphs	3
Isomorphic bisections of cubic graphs	3
Counting r-graphs without forbidden configurations	3