Journal of Combinatorial Theory Series B

Article	Citations
Editorial Board	21
On the Cayleyness of Praeger-Xu graphs	20
Concentration of maximum degree in random planar graphs	18
On the intersection conjecture for infinite trees of matroids	16
The feasible region of induced graphs	16
Decomposing hypergraphs into cycle factors	15
On 2-cycles of graphs	13
On the use of senders for asymmetric tuples of cliques in Ramsey theory	12
A new bound for the Brown–Erdős–Sós problem	11
Linkages and removable paths avoiding vertices	11
A weak box-perfect graph theorem	11
Clustered coloring of (path + 2K1)-free graphs on surfaces	11
A polynomial version of Cereceda's conjecture	10
Efficiently distinguishing all tangles in locally finite graphs	10
Editorial Board	10
A fast distributed algorithm for (Δ + 1)-edge-coloring	10
Trees with many leaves in tournaments	9
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	9
Counting oriented trees in digraphs with large minimum semidegree	9
Extremal problems for multigraphs	9
Minimal asymmetric hypergraphs	9
Embedding clique-factors in graphs with low ℓ-independence number	8
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	8
Characterising graphs with no subdivision of a wheel of bounded diameter	8
Random homomorphisms into the orthogonality graph	8

The Lovász-Cherkassky theorem in countable graphs	8
How connectivity affects the extremal number of trees	7
The Erdős Matching Conjecture and concentration inequalities	7
A half-integral Erdős-Pósa theorem for directed odd cycles	7
Determining triangulations and quadrangulations by boundary distances	7
N-detachable pairs in 3-connected matroids III: The theorem	7
Weak saturation in graphs: A combinatorial approach	7
Edge-colouring graphs with local list sizes	7
Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs	7
Orientations of golden-mean matroids	7
EPPA numbers of graphs	6
The inducibility of oriented stars	6
Editorial Board	6
Bipartite graphs with no K6 minor	6
Globally rigid powers of graphs	6
Tree amalgamations and quasi-isometries	6
On objects dual to tree-cut decompositions	6
Hitting all maximum stable sets in P5-free graphs	6
Ramsey number of 1-subdivisions of transitive tournaments	6
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	6
Dirac-type conditions for spanning bounded-degree hypertrees	6
Typical structure of hereditary properties of binary matroids	6
Reconstructing the degree sequence of a sparse graph from a partial deck	6
Graphs of bounded twin-width are quasi-polynomially χ-bounded	6
Percolation on dense random graphs with given degrees	6
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	6
Editorial Board	6
Treewidth versus clique number. II. Tree-independence number	5
Graphs with polynomially many minimal separators	5
Excluding a planar matching minor in bipartite graphs	5
Dirac-type theorems in random hypergraphs	5
An extremal problem motivated by triangle-free strongly regular graphs	5
Sharp bounds for the chromatic number of random Kneser graphs	5
Hamiltonian cycles and 1-factors in 5-regular graphs	5
Generalized cut trees for edge-connectivity	5
Counting cycles in planar triangulations	5
The minimum number of clique-saturating edges	5
Finite matchability under the matroidal Hall's condition	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
Isomorphic bisections of cubic graphs	4
The inverse Kazhdan-Lusztig polynomial of a matroid	4
On locally rainbow colourings	4
Turán problems for edge-ordered graphs	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
The multicolor size-Ramsey numbers of cycles	4
On graph classes with minor-universal elements	4
Countably determined ends and graphs	4
Turán numbers of r-graphs on r + 1 vertices	4
Maximal matroids in weak order posets	4

Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
A splitter theorem on 3-connected binary matroids and inner fans	4
Mutual embeddability in groups, trees, and spheres	4
Strengthening Rödl's theorem	3
Excluded minors are almost fragile II: Essential elements	3
The Erdős-Gyárfás function f(n,4<	3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	3
On the central levels problem	3
Edge-partitioning 3-edge-connected graphs into paths	3
Editorial Board	3
Twin-width can be exponential in treewidth	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
Structure in sparse k-critical graphs	3
Invariants of Tutte partitions and a q-analogue	3
Slow graph bootstrap percolation II: Accelerating properties	3
On Vizing's edge colouring question	3
H-factors in graphs with small independence number	3
Improved bounds for zero-sum cycles in Z	3
A lower bound on the average size of a connected vertex set of a graph	3
Note on disjoint faces in simple topological graphs	3
Triangle-free planar graphs with at most 64	3
Grid induced minor theorem for graphs of small degree	3
Extremal problems for pairs of triangles	3
On the cop number of toroidal graphs	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Editorial Board	3
Editorial Board	3
Every graph is eventually Turán-good	2
The core conjecture of Hilton and Zhao	2
Discrepancies of spanning trees and Hamilton cycles	2
No perfect state transfer in trees with more than 3 vertices	2
Dichromatic number and forced subdivisions	2
A Stallings type theorem for quasi-transitive graphs	2
Directed cycles with zero weight in Z	2
Jordan-like characterization of automorphism groups of planar graphs	2
Ramsey numbers of bounded degree trees versus general graphs	2
Quantum isomorphism of graphs from association schemes	2
Volume rigidity and algebraic shifting	2
Editorial Board	2
The matroid of a graphing	2
Graph product structure for non-minor-closed classes	2
K4-intersecting families of graphs	2
Editorial Board	2
List 4-colouring of planar graphs	2
Intersecting families with covering number three	2
On orders of automorphisms of vertex-transitive graphs	2
Prime-valent symmetric graphs with a quasi-semiregular automorphism	2
Rooted topological minors on four vertices	2
Jumps in speeds of hereditary properties in finite relational languages	2
Overfullness of critical class 2 graphs with a small core degree	2
An oriented discrepancy version of Dirac's theorem	2
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs	2
Erdős-Szekeres type theorems for ordered uniform matchings	2
Clique-width of point configurations	2
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	2
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs	2
Connectoids I: A universal end space theory	2
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	2
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	2
Many cliques with few edges and bounded maximum degree	2
Editorial Board	2
Editorial Board	2
Sparse graphs without long induced paths	2
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	2
An average degree condition for independent transversals	2
Clique immersion in graphs without a fixed bipartite graph	2
On the abstract chromatic number and its computability for finitely axiomatizable theories	2
The next case of Andrásfai's conjecture	2
The maximum number of copies of an even cycle in a planar graph	2
A solution to the 1-2-3 conjecture	2
A unified view of inequalities for distance-regular graphs, part I	2
Counting colorings of triangle-free graphs	2
The Farey graph is uniquely determined by its connectivity	1
Edge-critical subgraphs of Schrijver graphs II: The general case	1
Cubic graphs that cannot be covered with four perfect matchings	1
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	1
Extremal graphs for edge blow-up of graphs	1
Proper orientations and proper chromatic number	1
Dimension is polynomial in height for posets with planar cover graphs	1
A characterization of the Grassmann graphs	1

Excluded minors for the Klein bottle II. Cascades	1
Disjointness graphs of short polygonal chains	1
On sensitivity in bipartite Cayley graphs	1
Spectral arbitrariness for trees fails spectacularly	1
Optimal bounds for zero-sum cycles. I. Odd order	1
Turán graphs with bounded matching number	1
A proof of the tree alternative conjecture under the topological minor relation	1
The evolution of the structure of ABC-minimal trees	1
Binary scalar products	1
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	1
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs	1
Bounding χ by a fraction of Δ for graphs without large cliques	1
A critical probability for biclique partition of G,	1
Induced C4-free subgraphs with large average degree	1
Editorial Board	1
k-apices of minor-closed graph classes. I. Bounding the obstructions	1
Unavoidable hypergraphs	1
A proof of the upper matching conjecture for large graphs	1
Local 2-separators	1
Tilings in vertex ordered graphs	1
The excluded minors for 2- and 3-regular matroids	1
Typical and extremal aspects of friends-and-strangers graphs	1
On the unavoidability of oriented trees	1
Laminar tight cuts in matching covered graphs	1
Erdős-Hajnal-type results for monotone paths	1
Finite 3-connected-set-homogeneous locally 2K graphs and s-arc-transitive graphs	1
On the difference of mean subtree orders under edge contraction	1
The Turán number of blow-ups of trees	1
Cycles of a given length in tournaments	1
Counting Hamiltonian cycles in planar triangulations	1
On the spectrum of Hamiltonian cycles in the n-cube	1
On primitive 2-closed permutation groups of rank at most four	1
Kruskal–Katona-type problems via the entropy method	1
Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity	1
Characterising k-connected sets in infinite graphs	1
The structure of claw-free binary matroids	1
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	1
Linear cycles of consecutive lengths	1
Chromatic number is not tournament-local	1
Intersecting families of sets are typically trivial	1
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations	1
Chromatic index of dense quasirandom graphs	1
Embedding connected factorizations II	1
The binary matroids with no odd circuits of size exceeding five	1
Constructions of new q-cryptomorphisms	1
The Grid Theorem for vertex-minors	1
Editorial Board	1
Matrix representations of frame and lifted-graphic matroids correspond to gain functions	1
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]	1
Sparse induced subgraphs of large treewidth	1
Ascending subgraph decomposition	1
Canonical double covers of circulants	1
On the coequal values of total chromatic number and chromatic index	1
Topological ubiquity of trees	1
An explicit characterization of arc-transitive circulants	1
Ádám's conjecture	1
Cancellative hypergraphs and Steiner triple systems	1
The chromatic profile of locally bipartite graphs	1
On the automorphism group of a distance-regular graph	1
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs	1