Journal of Combinatorial Theory Series B

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-07-01 to 2025-07-01.)
ArticleCitations
A new bound for the Brown–Erdős–Sós problem21
Editorial Board18
On the Cayleyness of Praeger-Xu graphs17
Concentration of maximum degree in random planar graphs17
On the intersection conjecture for infinite trees of matroids16
The feasible region of induced graphs15
Decomposing hypergraphs into cycle factors15
On 2-cycles of graphs13
On the use of senders for asymmetric tuples of cliques in Ramsey theory12
A fast distributed algorithm for (Δ + 1)-edge-coloring11
Linkages and removable paths avoiding vertices11
Clustered coloring of (path + 2K1)-free graphs on surfaces11
Editorial Board10
Minimal asymmetric hypergraphs10
Efficiently distinguishing all tangles in locally finite graphs10
A polynomial version of Cereceda's conjecture10
A weak box-perfect graph theorem10
Counting oriented trees in digraphs with large minimum semidegree9
Characterising graphs with no subdivision of a wheel of bounded diameter9
Trees with many leaves in tournaments9
Random homomorphisms into the orthogonality graph9
Extremal problems for multigraphs9
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs9
The Lovász-Cherkassky theorem in countable graphs8
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs8
Determining triangulations and quadrangulations by boundary distances8
Embedding clique-factors in graphs with low ℓ-independence number8
Edge-colouring graphs with local list sizes7
Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs7
The Erdős Matching Conjecture and concentration inequalities7
How connectivity affects the extremal number of trees7
N-detachable pairs in 3-connected matroids III: The theorem7
A half-integral Erdős-Pósa theorem for directed odd cycles7
Obstructions for bounded shrub-depth and rank-depth7
Weak saturation in graphs: A combinatorial approach7
Orientations of golden-mean matroids6
Graphs of bounded twin-width are quasi-polynomially χ-bounded6
A solution of Li-Xia's problem on s-arc-transitive solvable Cayley graphs6
Tree amalgamations and quasi-isometries6
EPPA numbers of graphs6
Reconstructing the degree sequence of a sparse graph from a partial deck6
Percolation on dense random graphs with given degrees6
Ramsey number of 1-subdivisions of transitive tournaments6
Bipartite graphs with no K6 minor6
Hitting all maximum stable sets in P5-free graphs6
On objects dual to tree-cut decompositions6
The inducibility of oriented stars6
Editorial Board6
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth6
Flows on flow-admissible signed graphs6
Typical structure of hereditary properties of binary matroids6
Globally rigid powers of graphs5
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem5
Excluding a planar matching minor in bipartite graphs5
Sharp bounds for the chromatic number of random Kneser graphs5
Generalized cut trees for edge-connectivity5
Dirac-type conditions for spanning bounded-degree hypertrees5
Hamiltonian cycles and 1-factors in 5-regular graphs5
Counting cycles in planar triangulations5
Dirac-type theorems in random hypergraphs5
An improved lower bound of P(G,L)−P(G,k) for k-assignments L5
Editorial Board5
Finite matchability under the matroidal Hall's condition5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs5
Treewidth versus clique number. II. Tree-independence number5
Isomorphic bisections of cubic graphs4
Turán numbers of r-graphs on r + 1 vertices4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures4
Turán problems for edge-ordered graphs4
A lower bound on the average size of a connected vertex set of a graph4
The minimum number of clique-saturating edges4
The multicolor size-Ramsey numbers of cycles4
The inverse Kazhdan-Lusztig polynomial of a matroid4
On graph classes with minor-universal elements4
Countably determined ends and graphs4
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles4
Maximal matroids in weak order posets4
Graphs with polynomially many minimal separators4
On locally rainbow colourings4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant4
A splitter theorem on 3-connected binary matroids and inner fans4
Mutual embeddability in groups, trees, and spheres4
An extremal problem motivated by triangle-free strongly regular graphs4
On the central levels problem3
Editorial Board3
Edge-partitioning 3-edge-connected graphs into paths3
On Vizing's edge colouring question3
The Erdős-Gyárfás function f(n,4<3
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs3
Slow graph bootstrap percolation II: Accelerating properties3
A unified view of inequalities for distance-regular graphs, part I3
Editorial Board3
H-factors in graphs with small independence number3
Editorial Board3
Note on disjoint faces in simple topological graphs3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree3
Excluded minors are almost fragile II: Essential elements3
Triangle-free planar graphs with at most 643
Invariants of Tutte partitions and a q-analogue3
On the cop number of toroidal graphs3
One-to-one correspondence between interpretations of the Tutte polynomials3
Improved bounds for zero-sum cycles in Z3
Dirac-type theorems for long Berge cycles in hypergraphs3
Strengthening Rödl's theorem3
Structure in sparse k-critical graphs3
Grid induced minor theorem for graphs of small degree3
Extremal problems for pairs of triangles3
Twin-width can be exponential in treewidth3
0.026126146316528