Journal of Combinatorial Theory Series B

Article	Citations
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	18
A weak box-perfect graph theorem	17
Editorial Board	14
Editorial Board	14
On the spectrum of Hamiltonian cycles in the n-cube	13
A new bound for the Brown–Erdős–Sós problem	13
Editorial Board	11
The binary matroids with no odd circuits of size exceeding five	11
A localization method in Hamiltonian graph theory	10
Sharp bounds for the chromatic number of random Kneser graphs	10
Treewidth versus clique number. II. Tree-independence number	10
Intersecting families of sets are typically trivial	10
The Farey graph is uniquely determined by its connectivity	10
On orders of automorphisms of vertex-transitive graphs	10
On a recolouring version of Hadwiger's conjecture	8
Efficiently distinguishing all tangles in locally finite graphs	8
Rooted topological minors on four vertices	8
Dirac-type conditions for spanning bounded-degree hypertrees	8
k-apices of minor-closed graph classes. I. Bounding the obstructions	8
On the intersection conjecture for infinite trees of matroids	8
Bounding χ by a fraction of Δ for graphs without large cliques	8
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	8
Colouring graphs with sparse neighbourhoods: Bounds and applications	8
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	8
Linkages and removable paths avoiding vertices	8

Dichromatic number and forced subdivisions	7
Decomposing hypergraphs into cycle factors	7
On the Cayleyness of Praeger-Xu graphs	7
Entanglements	7
On 2-cycles of graphs	7
A fast distributed algorithm for (Δ + 1)-edge-coloring	7
On the use of senders for asymmetric tuples of cliques in Ramsey theory	7
Spanning trees in dense directed graphs	7
Overfullness of critical class 2 graphs with a small core degree	7
Nowhere-zero 3-flows in toroidal graphs	6
Hamilton cycles in dense regular digraphs and oriented graphs	6
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	6
Characterising k-connected sets in infinite graphs	6
Hamiltonian cycles and 1-factors in 5-regular graphs	6
Dirac-type theorems in random hypergraphs	6
The feasible region of induced graphs	6
Finite matchability under the matroidal Hall's condition	6
Concentration of maximum degree in random planar graphs	5
Kruskal–Katona-type problems via the entropy method	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
A scaling limit for the length of the longest cycle in a sparse random graph	5
Local 2-separators	5
Erdős-Szekeres type theorems for ordered uniform matchings	5
Graphs with all holes the same length	5
Generalized cut trees for edge-connectivity	5
Excluding a planar matching minor in bipartite graphs	5
Counting colorings of triangle-free graphs	5
Sparse graphs without long induced paths	5
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
Counting cycles in planar triangulations	5
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	5
Directed cycles with zero weight in Z	5
Turán numbers of r-graphs on r + 1 vertices	5
End spaces and tree-decompositions	4
Editorial Board	4
Embedding connected factorizations	4
Jumps in speeds of hereditary properties in finite relational languages	4
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	4
Editorial Board	4
Editorial Board	4
Editorial Board	4
Counting r-graphs without forbidden configurations	4
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	4
Approximating infinite graphs by normal trees	4
A simple proof of the Map Color Theorem for nonorientable surfaces	4
An extremal problem motivated by triangle-free strongly regular graphs	4
An explicit characterization of arc-transitive circulants	4
Editorial Board	4
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture	4
Jordan-like characterization of automorphism groups of planar graphs	4

Extremal problems for multigraphs	4
The minimum number of clique-saturating edges	4
Characterization of 4-critical triangle-free toroidal graphs	4
A polynomial version of Cereceda's conjecture	3
On sensitivity in bipartite Cayley graphs	3
Minimal asymmetric hypergraphs	3
Erdős-Hajnal for cap-free graphs	3
Random homomorphisms into the orthogonality graph	3
Trees with many leaves in tournaments	3
The minimum degree removal lemma thresholds	3
Enlarging vertex-flames in countable digraphs	3
Cancellative hypergraphs and Steiner triple systems	3
The structure of hypergraphs without long Berge cycles	3
The multicolor size-Ramsey numbers of cycles	3
Graphs with polynomially many minimal separators	3
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	3
Cycle decompositions in k-uniform hypergraphs	3
Quantum isomorphism of graphs from association schemes	3
Clique immersion in graphs without a fixed bipartite graph	3
The Grid Theorem for vertex-minors	3
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	3
Dimension is polynomial in height for posets with planar cover graphs	3
The inverse Kazhdan-Lusztig polynomial of a matroid	2
An oriented discrepancy version of Dirac's theorem	2
On locally rainbow colourings	2
Turán problems for edge-ordered graphs	2
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm	2
Obstructions for bounded shrub-depth and rank-depth	2
Laminar tight cuts in matching covered graphs	2
Intersecting families with covering number three	2
Embedding clique-factors in graphs with low ℓ-independence number	2
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2
Even-hole-free graphs still have bisimplicial vertices	2
Optimal oriented diameter of graphs with diameter 3	2
Many cliques with few edges and bounded maximum degree	2
Characterising graphs with no subdivision of a wheel of bounded diameter	2
Cycles of a given length in tournaments	2
The evolution of the structure of ABC-minimal trees	2
Counting oriented trees in digraphs with large minimum semidegree	2
Robin Thomas (1962–2020)	2
Optimal spread for spanning subgraphs of Dirac hypergraphs	2
The Lovász-Cherkassky theorem in countable graphs	2
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]	2
Finite 3-connected-set-homogeneous locally 2K graphs and s-arc-transitive graphs	2
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	2
Countably determined ends and graphs	2
Every graph is eventually Turán-good	2
Excluded minors for the Klein bottle II. Cascades	2
Typical and extremal aspects of friends-and-strangers graphs	2
How connectivity affects the extremal number of trees	2
Isomorphic bisections of cubic graphs	2
Editorial Board	2
Maximal matroids in weak order posets	2
N-detachable pairs in 3-connected matroids II: Life in X	2
Coloring polygon visibility graphs and their generalizations	2
On the largest planar graphs with everywhere positive combinatorial curvature	2
Crossings between non-homotopic edges	2
Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn	2
Hypergraph Turán densities can have arbitrarily large algebraic degree	2
Editorial Board	2
N-detachable pairs in 3-connected matroids III: The theorem	2
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	2
Editorial Board	2
Connectivity and choosability of graphs with no K minor	2
Total weight choosability of graphs: Towards the 1-2-3-conjecture	2
Mutual embeddability in groups, trees, and spheres	2
Edge-partitioning 3-edge-connected graphs into paths	1
On graph classes with minor-universal elements	1
The structure of claw-free binary matroids	1
Tight bounds for divisible subdivisions	1
Minimal quadrangulations of surfaces	1
On the cop number of toroidal graphs	1
One-to-one correspondence between interpretations of the Tutte polynomials	1
Excluded minors for the Klein bottle I. Low connectivity case	1
On Vizing's edge colouring question	1
Immersion and clustered coloring	1
On a conjecture of spectral extremal problems	1
Embedding loose spanning trees in 3-uniform hypergraphs	1
Isomorphisms between random graphs	1
Pure pairs. IV. Trees in bipartite graphs	1

Every nice graph is (1,5)-choosable	1
Count and cofactor matroids of highly connected graphs	1
On primitive 2-closed permutation groups of rank at most four	1
A Stallings type theorem for quasi-transitive graphs	1
Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity	1
No perfect state transfer in trees with more than 3 vertices	1
Polynomial χ-binding functions for t-broom-free graphs	1
Matrix representations of frame and lifted-graphic matroids correspond to gain functions	1
Two-arc-transitive bicirculants	1
The core conjecture of Hilton and Zhao	1
Upper bounds for the necklace folding problems	1
Dynamics of cycles in polyhedra I: The isolation lemma	1
Editorial Board	1
Extended commonality of paths and cycles via Schur convexity	1
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs	1
Twin-width can be exponential in treewidth	1
Discrepancy and sparsity	1
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations	1
A lower bound on the average size of a connected vertex set of a graph	1
A critical probability for biclique partition of G,	1
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes	1
Note on disjoint faces in simple topological graphs	1
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number	1
Approximating TSP walks in subcubic graphs	1
H-factors in graphs with small independence number	1
Edge-colouring graphs with local list sizes	1
Linear three-uniform hypergraphs with no Berge path of given length	1
Prime-valent symmetric graphs with a quasi-semiregular automorphism	1
Clustered variants of Hajós' conjecture	1
Crux, space constraints and subdivisions	1
Ádám's conjecture	1
Binary scalar products	1
Turán graphs with bounded matching number	1
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	1
Determining triangulations and quadrangulations by boundary distances	1
On the central levels problem	1
The burning number conjecture holds asymptotically	1
Turán problems for mixed graphs	1
Tutte paths and long cycles in circuit graphs	1
On the difference of mean subtree orders under edge contraction	1
Graph partitions under average degree constraint	1
The generalised Oberwolfach problem	1
Packing A-paths of length zero modulo a prime	1
Spectral arbitrariness for trees fails spectacularly	1
The Erdős Matching Conjecture and concentration inequalities	1
Maker-breaker percolation games II: Escaping to infinity	1
On the coequal values of total chromatic number and chromatic index	1
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs	1
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs	1
On a problem of El-Zahar and Erdős	1
List 4-colouring of planar graphs	1
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza	1
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	1
Editorial Board	1