Journal of Combinatorial Theory Series B

Article	Citations
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	20
Linkages and removable paths avoiding vertices	16
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	14
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	14
Editorial Board	13
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	10
3-List-coloring graphs of girth at least five on surfaces	10
Editorial Board	10
Counting colorings of triangle-free graphs	10
Characterising k-connected sets in infinite graphs	9
The feasible region of induced graphs	9
A new bound for the Brown–Erdős–Sós problem	8
On the Cayleyness of Praeger-Xu graphs	8
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	8
A fast distributed algorithm for (Δ + 1)-edge-coloring	8
Decomposing hypergraphs into cycle factors	8
The binary matroids with no odd circuits of size exceeding five	8
On the spectrum of Hamiltonian cycles in the n-cube	8
Editorial Board	8
Spanning trees in dense directed graphs	7
Hamiltonian cycles and 1-factors in 5-regular graphs	7
Hamilton cycles in dense regular digraphs and oriented graphs	7
On orders of automorphisms of vertex-transitive graphs	7
Concentration of maximum degree in random planar graphs	7
On the intersection conjecture for infinite trees of matroids	7

Treewidth versus clique number. II. Tree-independence number	7
Maximising the number of cycles in graphs with forbidden subgraphs	7
Overfullness of critical class 2 graphs with a small core degree	7
Sharp bounds for the chromatic number of random Kneser graphs	7
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	7
Generalized cut trees for edge-connectivity	7
Intersecting families of sets are typically trivial	7
Rooted topological minors on four vertices	6
Bounding χ by a fraction of Δ for graphs without large cliques	6
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	6
Finite matchability under the matroidal Hall's condition	6
On 2-cycles of graphs	6
A localization method in Hamiltonian graph theory	6
A scaling limit for the length of the longest cycle in a sparse random graph	6
Dichromatic number and forced subdivisions	6
Editorial Board	6
On the use of senders for asymmetric tuples of cliques in Ramsey theory	5
Kruskal–Katona-type problems via the entropy method	5
Colouring graphs with sparse neighbourhoods: Bounds and applications	5
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	5
The Farey graph is uniquely determined by its connectivity	5
Directed cycles with zero weight in Z	5
Entanglements	5
Excluding a planar matching minor in bipartite graphs	5
Graphs with all holes the same length	5
Dirac-type theorems in random hypergraphs	5
Dirac-type conditions for spanning bounded-degree hypertrees	5
A weak box-perfect graph theorem	5
Nowhere-zero 3-flows in toroidal graphs	5
Efficiently distinguishing all tangles in locally finite graphs	5
On a recolouring version of Hadwiger's conjecture	5
k-apices of minor-closed graph classes. I. Bounding the obstructions	5
The evolution of the structure of ABC-minimal trees	4
The Grid Theorem for vertex-minors	4
N-detachable pairs in 3-connected matroids II: Life in X	4
Editorial Board	4
Counting oriented trees in digraphs with large minimum semidegree	4
An oriented discrepancy version of Dirac's theorem	4
Local 2-separators	4
Stability of graph pairs	4
Dimension is polynomial in height for posets with planar cover graphs	4
The minimum degree removal lemma thresholds	4
Sparse graphs without long induced paths	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
Turán numbers of r-graphs on r + 1 vertices	4
Editorial Board	4
End spaces and tree-decompositions	4
Cycle decompositions in k-uniform hypergraphs	4
Counting cycles in planar triangulations	4
Extremal problems for multigraphs	3

Graphs with polynomially many minimal separators	3
The inverse Kazhdan-Lusztig polynomial of a matroid	3
Editorial Board	3
Embedding connected factorizations	3
Maximal matroids in weak order posets	3
Minimal asymmetric hypergraphs	3
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	3
Enlarging vertex-flames in countable digraphs	3
Editorial Board	3
An extremal problem motivated by triangle-free strongly regular graphs	3
Typical and extremal aspects of friends-and-strangers graphs	3
Editorial Board	3
Clique immersion in graphs without a fixed bipartite graph	3
Characterization of 4-critical triangle-free toroidal graphs	3
Erdős-Hajnal for cap-free graphs	3
Isomorphic bisections of cubic graphs	3
Counting r-graphs without forbidden configurations	3
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	3
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture	3
Quantum isomorphism of graphs from association schemes	3
On sensitivity in bipartite Cayley graphs	2
Jordan-like characterization of automorphism groups of planar graphs	2
The minimum number of clique-saturating edges	2
Optimal oriented diameter of graphs with diameter 3	2
Embedding clique-factors in graphs with low ℓ-independence number	2
The core conjecture of Hilton and Zhao	2
Erdős-Szekeres type theorems for ordered uniform matchings	2
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2
No perfect state transfer in trees with more than 3 vertices	2
On locally rainbow colourings	2
Crux, space constraints and subdivisions	2
Jumps in speeds of hereditary properties in finite relational languages	2
Edge-colouring graphs with local list sizes	2
Cancellative hypergraphs and Steiner triple systems	2
Characterising graphs with no subdivision of a wheel of bounded diameter	2
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	2
Total weight choosability of graphs: Towards the 1-2-3-conjecture	2
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number	2
Excluded minors for the Klein bottle II. Cascades	2
Tight bounds for divisible subdivisions	2
On a conjecture of spectral extremal problems	2
Editorial Board	2
Random homomorphisms into the orthogonality graph	2
A Stallings type theorem for quasi-transitive graphs	2
An explicit characterization of arc-transitive circulants	2
Every graph is eventually Turán-good	2
Approximating infinite graphs by normal trees	2
The multicolor size-Ramsey numbers of cycles	2
A simple proof of the Map Color Theorem for nonorientable surfaces	2
Coloring polygon visibility graphs and their generalizations	2
Trees with many leaves in tournaments	2
Turán graphs with bounded matching number	2
Spectral arbitrariness for trees fails spectacularly	2
Count and cofactor matroids of highly connected graphs	2
The structure of hypergraphs without long Berge cycles	2
Even-hole-free graphs still have bisimplicial vertices	2
A polynomial version of Cereceda's conjecture	2
Connectivity and choosability of graphs with no K minor	2
Relating the cut distance and the weak* topology for graphons	1
Countably determined ends and graphs	1
Tutte paths and long cycles in circuit graphs	1
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes	1
Hypergraph Turán densities can have arbitrarily large algebraic degree	1
Two-arc-transitive bicirculants	1
Many cliques with few edges and bounded maximum degree	1
The burning number conjecture holds asymptotically	1
Robin Thomas (1962–2020)	1
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	1
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]	1
Turán problems for edge-ordered graphs	1
Maker-breaker percolation games II: Escaping to infinity	1
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	1
Crossings between non-homotopic edges	1
One-to-one correspondence between interpretations of the Tutte polynomials	1
Editorial Board	1
A lower bound on the average size of a connected vertex set of a graph	1
Editorial Board	1
How connectivity affects the extremal number of trees	1
Editorial Board	1
On the average degree of edge chromatic critical graphs	1

Edge-partitioning 3-edge-connected graphs into paths	1
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm	1
Finite 3-connected-set-homogeneous locally 2K graphs and s-arc-transitive graphs	1
Approximating TSP walks in subcubic graphs	1
Minimal quadrangulations of surfaces	1
Optimal spread for spanning subgraphs of Dirac hypergraphs	1
Obstructions for bounded shrub-depth and rank-depth	1
List 4-colouring of planar graphs	1
Editorial Board	1
Matrix representations of frame and lifted-graphic matroids correspond to gain functions	1
On a problem of El-Zahar and Erdős	1
The Lovász-Cherkassky theorem in countable graphs	1
On Vizing's edge colouring question	1
Graph functionality	1
Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn	1
Polynomial bounds for centered colorings on proper minor-closed graph classes	1
On the coequal values of total chromatic number and chromatic index	1
Determining triangulations and quadrangulations by boundary distances	1
A proof of the tree alternative conjecture under the topological minor relation	1
Dynamics of cycles in polyhedra I: The isolation lemma	1
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations	1
Disjoint isomorphic balanced clique subdivisions	1
Prime-valent symmetric graphs with a quasi-semiregular automorphism	1
A critical probability for biclique partition of G,	1
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	1
Upper bounds for the necklace folding problems	1
N-detachable pairs in 3-connected matroids III: The theorem	1
Editorial Board	1
Editorial Board	1
A Harary-Sachs theorem for hypergraphs	1
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs	1
On primitive 2-closed permutation groups of rank at most four	1
Cycles of a given length in tournaments	1
Excluded minors for the Klein bottle I. Low connectivity case	1
The immersion-minimal infinitely edge-connected graph	1
Mutual embeddability in groups, trees, and spheres	1
Isomorphisms between random graphs	1
Turán problems for mixed graphs	1
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	1
On the largest planar graphs with everywhere positive combinatorial curvature	1
How to build a pillar: A proof of Thomassen's conjecture	1
On graph classes with minor-universal elements	1
Immersion and clustered coloring	1
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs	1
The generalised Oberwolfach problem	1
Graph partitions under average degree constraint	1
On the difference of mean subtree orders under edge contraction	1
Binary scalar products	1
Laminar tight cuts in matching covered graphs	1