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 2022-06-01 to 2026-06-01.)

Article	Citations
Linkages and removable paths avoiding vertices	36
Concentration of maximum degree in random planar graphs	33
A new bound for the Brown–Erdős–Sós problem	31
Decomposing hypergraphs into cycle factors	23
On 2-cycles of graphs	22
Clustered coloring of (path + 2K1)-free graphs on surfaces	21
3-colorable planar graphs have an intersection segment representation using 3 slopes	19
A weak box-perfect graph theorem	18
The feasible region of induced graphs	16
On the use of senders for asymmetric tuples of cliques in Ramsey theory	14
Stability in Bondy's theorem on paths and cycles	14
Efficiently distinguishing all tangles in locally finite graphs	12
Characterising graphs with no subdivision of a wheel of bounded diameter	11
Random homomorphisms into the orthogonality graph	11
Minimal asymmetric hypergraphs	11
Embedding clique-factors in graphs with low ℓ-independence number	11
Editorial Board	11
A polynomial version of Cereceda's conjecture	10
Counting oriented trees in digraphs with large minimum semidegree	10
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	10
Determining triangulations and quadrangulations by boundary distances	9
Degree-truncated choosability of graphs	9
Trees with many leaves in tournaments	9
How connectivity affects the extremal number of trees	8
The Lovász-Cherkassky theorem in countable graphs	8

Finding irregular subgraphs via local adjustments	8
Rigidity and reconstruction in matroids of highly connected graphs	8
Edge-colouring graphs with local list sizes	8
Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs	8
On graphs without cycles of length 0 modulo 4	8
Weak saturation in graphs: A combinatorial approach	8
Orientations of golden-mean matroids	7
Cutting corners	7
The inducibility of oriented stars	7
Typical structure of hereditary properties of binary matroids	7
A half-integral Erdős-Pósa theorem for directed odd cycles	7
Graphs of bounded twin-width are quasi-polynomially χ-bounded	7
The Erdős Matching Conjecture and concentration inequalities	7
Integral biflow maximization	7
Reconstructing the degree sequence of a sparse graph from a partial deck	6
Weak diameter choosability of graphs with an excluded minor	6
Hitting all maximum stable sets in P5-free graphs	6
On objects dual to tree-cut decompositions	6
EPPA numbers of graphs	6
Editorial Board	6
Fast algorithms for Vizing's theorem on bounded degree graphs	5
Dirac-type theorems in random hypergraphs	5
Transversals via regularity	5
Finite matchability under the matroidal Hall's condition	5
Bipartite graphs with no K6 minor	5
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	5
Percolation on dense random graphs with given degrees	5
Globally rigid powers of graphs	5
Splitting-off in hypergraphs	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	5
Tree amalgamations and quasi-isometries	5
Reuniting χ-boundedness with polynomial χ-boundedness	5
Treewidth versus clique number. II. Tree-independence number	5
Sharp bounds for the chromatic number of random Kneser graphs	5
Editorial Board	5
Detachable pairs in 3-connected matroids and simple 3-connected graphs	5
Ramsey number of 1-subdivisions of transitive tournaments	5
Generalized cut trees for edge-connectivity	4
Excluding a planar matching minor in bipartite graphs	4
Maximal matroids in weak order posets	4
Turán numbers of r-graphs on r + 1 vertices	4
Mutual embeddability in groups, trees, and spheres	4
Countably determined ends and graphs	4
Dirac-type conditions for spanning bounded-degree hypertrees	4
On locally rainbow colourings	4
The multicolor size-Ramsey numbers of cycles	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
A splitter theorem on 3-connected binary matroids and inner fans	4
On graph classes with minor-universal elements	4

The minimum number of clique-saturating edges	4
Counting cycles in planar triangulations	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
An extremal problem motivated by triangle-free strongly regular graphs	4
Turán problems for edge-ordered graphs	4
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
Editorial Board	4
Triangle-free planar graphs with at most 64	3
Twin-width can be exponential in treewidth	3
Strengthening Rödl's theorem	3
Editorial Board	3
Editorial Board	3
Excluded minors are almost fragile II: Essential elements	3
Approximate packing of independent transversals in locally sparse graphs	3
Extremal problems for pairs of triangles	3
Note on disjoint faces in simple topological graphs	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
Edge-partitioning 3-edge-connected graphs into paths	3
Improved bounds for zero-sum cycles in	3
Invariants of Tutte partitions and a q-analogue	3
A solution to the 1-2-3 conjecture	3
The codegree Turán density of 3-uniform tight cycles	3
On Vizing's edge colouring question	3
Structure in sparse k-critical graphs	3
On the central levels problem	3
H-factors in graphs with small independence number	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	3
The Erdős-Gyárfás function f(n,4<	3