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

Article	Citations
Linkages and removable paths avoiding vertices	38
Concentration of maximum degree in random planar graphs	37
A new bound for the Brown–Erdős–Sós problem	35
Decomposing hypergraphs into cycle factors	28
On 2-cycles of graphs	24
Clustered coloring of (path + 2K1)-free graphs on surfaces	23
3-colorable planar graphs have an intersection segment representation using 3 slopes	20
The feasible region of induced graphs	19
Stability in Bondy's theorem on paths and cycles	15
On the use of senders for asymmetric tuples of cliques in Ramsey theory	15
Efficiently distinguishing all tangles in locally finite graphs	13
A weak box-perfect graph theorem	13
Minimal asymmetric hypergraphs	12
Characterising graphs with no subdivision of a wheel of bounded diameter	12
Editorial Board	12
Embedding clique-factors in graphs with low ℓ-independence number	11
Random homomorphisms into the orthogonality graph	11
Counting oriented trees in digraphs with large minimum semidegree	10
Degree-truncated choosability of graphs	9
On graphs without cycles of length 0 modulo 4	9
Trees with many leaves in tournaments	9
The Lovász-Cherkassky theorem in countable graphs	8
Determining triangulations and quadrangulations by boundary distances	8
Rigidity and reconstruction in matroids of highly connected graphs	8
Edge-colouring graphs with local list sizes	8

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

Turán problems for edge-ordered graphs	4
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
Edge-partitioning 3-edge-connected graphs into paths	4
Turán numbers of r-graphs on r + 1 vertices	4
An improved upper bound for the multicolour Ramsey number of odd cycles	4
Countably determined ends and graphs	4
Editorial Board	4
Editorial Board	4
The Erdős-Gyárfás function f(n,4<	3
Invariants of Tutte partitions and a q-analogue	3
On the central levels problem	3
On Vizing's edge colouring question	3
Excluded minors are almost fragile II: Essential elements	3
Grid induced minor theorem for graphs of small degree	3
Slow graph bootstrap percolation II: Accelerating properties	3
Triangle-free planar graphs with at most 64	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Note on disjoint faces in simple topological graphs	3
Chords in longest cycles in 3-connected graphs	3
Strengthening Rödl's theorem	3
Graph product structure for non-minor-closed classes	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
Editorial Board	3
Twin-width can be exponential in treewidth	3
H-factors in graphs with small independence number	3
Structure in sparse k-critical graphs	3
Corrigendum to “On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes” [J. Comb. Theory, Ser. B 103 (4) (2013) 428–467]	3