Journal of Combinatorial Theory Series B

Article	Citations
On the use of senders for asymmetric tuples of cliques in Ramsey theory	35
Linkages and removable paths avoiding vertices	33
Decomposing hypergraphs into cycle factors	31
Concentration of maximum degree in random planar graphs	22
On 2-cycles of graphs	22
Efficiently distinguishing all tangles in locally finite graphs	21
A new bound for the Brown–Erdős–Sós problem	17
Clustered coloring of (path + 2K1)-free graphs on surfaces	17
3-colorable planar graphs have an intersection segment representation using 3 slopes	16
A weak box-perfect graph theorem	14
The feasible region of induced graphs	13
Stability in Bondy's theorem on paths and cycles	11
Trees with many leaves in tournaments	11
Minimal asymmetric hypergraphs	11
Editorial Board	11
Embedding clique-factors in graphs with low ℓ-independence number	10
Random homomorphisms into the orthogonality graph	10
Characterising graphs with no subdivision of a wheel of bounded diameter	10
A polynomial version of Cereceda's conjecture	10
Extremal problems for multigraphs	10
Degree-truncated choosability of graphs	9
How connectivity affects the extremal number of trees	9
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	9
Determining triangulations and quadrangulations by boundary distances	9
Counting oriented trees in digraphs with large minimum semidegree	9

The Lovász-Cherkassky theorem in countable graphs	8
Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs	8
Rigidity and reconstruction in matroids of highly connected graphs	8
A half-integral Erdős-Pósa theorem for directed odd cycles	8
Edge-colouring graphs with local list sizes	8
Weak saturation in graphs: A combinatorial approach	8
On graphs without cycles of length 0 modulo 4	8
Orientations of golden-mean matroids	7
The Erdős Matching Conjecture and concentration inequalities	7
Finding irregular subgraphs via local adjustments	7
Reconstructing the degree sequence of a sparse graph from a partial deck	7
Cutting corners	7
Graphs of bounded twin-width are quasi-polynomially χ-bounded	7
Typical structure of hereditary properties of binary matroids	7
Integral biflow maximization	7
Hitting all maximum stable sets in P5-free graphs	6
Weak diameter choosability of graphs with an excluded minor	6
EPPA numbers of graphs	6
Editorial Board	6
The inducibility of oriented stars	6
On objects dual to tree-cut decompositions	6
Percolation on dense random graphs with given degrees	6
Reuniting χ-boundedness with polynomial χ-boundedness	5
Finite matchability under the matroidal Hall's condition	5
Treewidth versus clique number. II. Tree-independence number	5
Dirac-type conditions for spanning bounded-degree hypertrees	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	5
Globally rigid powers of graphs	5
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	5
Fast algorithms for Vizing's theorem on bounded degree graphs	5
Dirac-type theorems in random hypergraphs	5
Counting cycles in planar triangulations	5
Generalized cut trees for edge-connectivity	5
Tree amalgamations and quasi-isometries	5
Ramsey number of 1-subdivisions of transitive tournaments	5
Detachable pairs in 3-connected matroids and simple 3-connected graphs	5
Excluding a planar matching minor in bipartite graphs	5
Hamiltonian cycles and 1-factors in 5-regular graphs	5
Editorial Board	5
Bipartite graphs with no K6 minor	5
Splitting-off in hypergraphs	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
The minimum number of clique-saturating edges	4
A splitter theorem on 3-connected binary matroids and inner fans	4
Countably determined ends and graphs	4
Turán problems for edge-ordered graphs	4
An extremal problem motivated by triangle-free strongly regular graphs	4
Sharp bounds for the chromatic number of random Kneser graphs	4
Maximal matroids in weak order posets	4

Turán numbers of r-graphs on r + 1 vertices	4
Editorial Board	4
On graph classes with minor-universal elements	4
Mutual embeddability in groups, trees, and spheres	4
Transversals via regularity	4
On locally rainbow colourings	4
The multicolor size-Ramsey numbers of cycles	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
Editorial Board	4
H-factors in graphs with small independence number	4
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
The codegree Turán density of 3-uniform tight cycles	3
Extremal problems for pairs of triangles	3
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs	3
Invariants of Tutte partitions and a q-analogue	3
Twin-width can be exponential in treewidth	3
Editorial Board	3
Triangle-free planar graphs with at most 64	3
A solution to the 1-2-3 conjecture	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
Structure in sparse k-critical graphs	3
Edge-partitioning 3-edge-connected graphs into paths	3
Improved bounds for zero-sum cycles in Z	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Excluded minors are almost fragile II: Essential elements	3
The Erdős-Gyárfás function f(n,4<	3
A unified view of inequalities for distance-regular graphs, part I	3
Strengthening Rödl's theorem	3
On Vizing's edge colouring question	3
On the central levels problem	3
Note on disjoint faces in simple topological graphs	3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	3
No perfect state transfer in trees with more than 3 vertices	2
Non-degenerate hypergraphs with exponentially many extremal constructions	2
A Stallings type theorem for quasi-transitive graphs	2
On orders of automorphisms of vertex-transitive graphs	2
List 4-colouring of planar graphs	2
Editorial Board	2
Quantum isomorphism of graphs from association schemes	2
The maximum number of copies of an even cycle in a planar graph	2
Asymptotic half-grid and full-grid minors	2
Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors	2
Erdős-Szekeres type theorems for ordered uniform matchings	2
Graph product structure for non-minor-closed classes	2
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]	2
Volume rigidity and algebraic shifting	2
The next case of Andrásfai's conjecture	2
Editorial Board	2
K4-intersecting families of graphs	2
Directed cycles with zero weight in Z	2
An average degree condition for independent transversals	2
The core conjecture of Hilton and Zhao	2
Counting colorings of triangle-free graphs	2
Rigid partitions: From high connectivity to random graphs	2
Rooted topological minors on four vertices	2
Clique immersion in graphs without a fixed bipartite graph	2
Discrepancies of spanning trees and Hamilton cycles	2
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	2
On the abstract chromatic number and its computability for finitely axiomatizable theories	2
Jordan-like characterization of automorphism groups of planar graphs	2
Grid induced minor theorem for graphs of small degree	2
Sparse graphs without long induced paths	2
Connectoids I: A universal end space theory	2
Prime-valent symmetric graphs with a quasi-semiregular automorphism	2
Every graph is eventually Turán-good	2
The matroid of a graphing	2
Intersecting families with covering number three	2
Overfullness of critical class 2 graphs with a small core degree	2
Editorial Board	2
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	2
An oriented discrepancy version of Dirac's theorem	2
A matrix realization of spectral bounds	2
Jumps in speeds of hereditary properties in finite relational languages	2
Ramsey numbers of bounded degree trees versus general graphs	2
Editorial Board	2
Clique-width of point configurations	2
Connectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs	2
Slow graph bootstrap percolation II: Accelerating properties	2
Approximate packing of independent transversals in locally sparse graphs	2
Editorial Board	2

Excluding disjoint Kuratowski graphs	2
Cancellative hypergraphs and Steiner triple systems	1
k-apices of minor-closed graph classes. I. Bounding the obstructions	1
A critical probability for biclique partition of G,	1
Chromatic index of dense quasirandom graphs	1
Editorial Board	1
Optimal bounds for zero-sum cycles. I. Odd order	1
When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices	1
On the size of two minimal linkages	1
Bounding χ by a fraction of Δ for graphs without large cliques	1
Topological ubiquity of trees	1
Ascending subgraph decomposition	1
Cubic graphs with no eigenvalues in the interval (−1,1)	1
Embedding connected factorizations II	1
On the coequal values of total chromatic number and chromatic index	1
Kruskal–Katona-type problems via the entropy method	1
Tilings in vertex ordered graphs	1
On the difference of mean subtree orders under edge contraction	1
On the automorphism group of a distance-regular graph	1
The Turán number of blow-ups of trees	1
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	1
A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers	1
Two-arc-transitive bicirculants	1
Typical and extremal aspects of friends-and-strangers graphs	1
Ádám's conjecture	1
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs	1
A proof of the tree alternative conjecture under the topological minor relation	1
Cycle matroids of graphings: From convergence to duality	1
Linear cycles of consecutive lengths	1
Minimal quadrangulations of surfaces	1
Chromatic number is not tournament-local	1
Local 2-separators	1
Counting Hamiltonian cycles in planar triangulations	1
Disjointness graphs of short polygonal chains	1
Canonical double covers of circulants	1
Spectral arbitrariness for trees fails spectacularly	1
On sensitivity in bipartite Cayley graphs	1
Editorial Board	1
Excluded minors for the Klein bottle II. Cascades	1
Hyperbolicity theorems for correspondence colouring	1
A characterization of the Grassmann graphs	1
Matrix representations of frame and lifted-graphic matroids correspond to gain functions	1
Characterising k-connected sets in infinite graphs	1
Editorial Board	1
Turán graphs with bounded matching number	1
The Grid Theorem for vertex-minors	1
Dimension is polynomial in height for posets with planar cover graphs	1
The excluded minors for 2- and 3-regular matroids	1
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations	1
Binary scalar products	1
Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity	1
The chromatic profile of locally bipartite graphs	1
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	1
Tree independence number II. Three-path-configurations	1
On primitive 2-closed permutation groups of rank at most four	1
Cycles of a given length in tournaments	1
Editorial Board	1
Induced C4-free subgraphs with large average degree	1
Sparse induced subgraphs of large treewidth	1
Finite 3-connected-set-homogeneous locally 2K graphs and s-arc-transitive graphs	1
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	1
A characterization of testable hypergraph properties	1
An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps	1
Intersecting families of sets are typically trivial	1
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem	1
Dynamics of cycles in polyhedra I: The isolation lemma	1
Inducibility in H-free graphs and inducibility of Turán graphs	1
Proper orientations and proper chromatic number	1
Approximating TSP walks in subcubic graphs	1
Universality for graphs with bounded density	1