Journal of Combinatorial Theory Series B

Article	Citations
Edge-transitive bi-Cayley graphs	26
Generalized Turán problems for even cycles	25
The 1–2–3 Conjecture almost holds for regular graphs	20
Planar graphs that need four pages	19
Towards tight(er) bounds for the Excluded Grid Theorem	17
The Erdős Matching Conjecture and concentration inequalities	16
A Harary-Sachs theorem for hypergraphs	14
The Alon-Tarsi number of a planar graph minus a matching	14
Extremal graphs for edge blow-up of graphs	14
Colouring graphs with sparse neighbourhoods: Bounds and applications	13
The multicolour size-Ramsey number of powers of paths	11
Constructions of new q-cryptomorphisms	10
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	10
On the rational Turán exponents conjecture	10
The evolution of the structure of ABC-minimal trees	10
Decompositions into isomorphic rainbow spanning trees	10
On a conjecture of spectral extremal problems	9
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five	9
Grid induced minor theorem for graphs of small degree	9
Subdivisions of digraphs in tournaments	9
Graph product structure for non-minor-closed classes	8
Clique immersion in graphs without a fixed bipartite graph	8
K-factors in graphs with low independence number	8
Reconfiguring colorings of graphs with bounded maximum average degree	8
Completion and deficiency problems	8

Canonical trees of tree-decompositions	8
Most Laplacian eigenvalues of a tree are small	8
Clustered variants of Hajós' conjecture	7
Graph functionality	7
The inverse Kazhdan-Lusztig polynomial of a matroid	7
A scaling limit for the length of the longest cycle in a sparse random graph	7
Regular Cayley maps for dihedral groups	7
On the cop number of toroidal graphs	7
The structure of hypergraphs without long Berge cycles	7
Total weight choosability of graphs: Towards the 1-2-3-conjecture	7
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	7
Density of C−4-critical signed graphs	7
Connectivity and choosability of graphs with no K minor	7
Approximating infinite graphs by normal trees	7
Dichromatic number and forced subdivisions	7
The feasible region of hypergraphs	7
An average degree condition for independent transversals	6
Erdős-Pósa property of chordless cycles and its applications	6
A polynomial version of Cereceda's conjecture	6
Minimum degree conditions for monochromatic cycle partitioning	6
On the lower bound of the sum of the algebraic connectivity of a graph and its complement	6
Circular flows via extended Tutte orientations	6
Disjoint isomorphic balanced clique subdivisions	6
The Grid Theorem for vertex-minors	6
On Hamiltonian cycles in hypergraphs with dense link graphs	6
Cubic graphs that cannot be covered with four perfect matchings	6
Turán problems for edge-ordered graphs	6
Spanning trees in dense directed graphs	6
On edge-primitive 3-arc-transitive graphs	5
How to build a pillar: A proof of Thomassen's conjecture	5
Obstructions for bounded shrub-depth and rank-depth	5
Stability for vertex isoperimetry in the cube	5
An asymptotic resolution of a problem of Plesník	5
Bounding χ by a fraction of Δ for graphs without large cliques	5
The Turán number of blow-ups of trees	5
Flows on flow-admissible signed graphs	5
Relatively small counterexamples to Hedetniemi's conjecture	5
Polynomial bounds for centered colorings on proper minor-closed graph classes	5
Even-hole-free graphs still have bisimplicial vertices	5
Jumps in speeds of hereditary properties in finite relational languages	5
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	5
Super-pancyclic hypergraphs and bipartite graphs	5
Sparse hypergraphs: New bounds and constructions	5
On the spectral gap and the automorphism group of distance-regular graphs	5
Every nice graph is (1,5)-choosable	5
Induced subgraphs of graphs with large chromatic number. VI. Banana trees	5
A lower bound on the average size of a connected vertex set of a graph	5
Progress towards Nash-Williams' conjecture on triangle decompositions	5
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
Tilings in vertex ordered graphs	5

The (theta, wheel)-free graphs Part IV: Induced paths and cycles	5
Evaluations of Tutte polynomials of regular graphs	4
Canonical double covers of circulants	4
Immersion and clustered coloring	4
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	4
The multicolor size-Ramsey numbers of cycles	4
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true	4
Dirac-type theorems in random hypergraphs	4
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs	4
A proof of the upper matching conjecture for large graphs	4
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture	4
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs	4
Tangles and the Stone-Čech compactification of infinite graphs	4
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	4
The Farey graph is uniquely determined by its connectivity	4
A unified existence theorem for normal spanning trees	4
Topological ubiquity of trees	4
A solution to the 1-2-3 conjecture	4
Edge-critical subgraphs of Schrijver graphs II: The general case	4
Many cliques with few edges and bounded maximum degree	4
Embedding clique-factors in graphs with low ℓ-independence number	4
Gaps in the cycle spectrum of 3-connected cubic planar graphs	4
A new bound for the Brown–Erdős–Sós problem	4
A unified approach to hypergraph stability	4
Discrepancies of spanning trees and Hamilton cycles	3
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	3
On the unavoidability of oriented trees	3
A Stallings type theorem for quasi-transitive graphs	3
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm	3
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	3
Global rigidity of periodic graphs under fixed-lattice representations	3
A localization method in Hamiltonian graph theory	3
Erdős-Hajnal-type results for monotone paths	3
On the average degree of edge chromatic critical graphs II	3
Dismantlability, connectedness, and mixing in relational structures	3
On the average degree of edge chromatic critical graphs	3
Local 2-separators	3
A fast distributed algorithm for (Δ + 1)-edge-coloring	3
Characterising k-connected sets in infinite graphs	3
Contact graphs of ball packings	3
A solution of Li-Xia's problem on s-arc-transitive solvable Cayley graphs	3
Almost all optimally coloured complete graphs contain a rainbow Hamilton path	3
Hedetniemi's conjecture is asymptotically false	3
The generalised Oberwolfach problem	3
N-detachable pairs in 3-connected matroids II: Life in X	3
A counterexample to prism-hamiltonicity of 3-connected planar graphs	3
Treewidth versus clique number. II. Tree-independence number	3
On the Cayleyness of Praeger-Xu graphs	2
Trees with few leaves in tournaments	2
Packing cycles in undirected group-labelled graphs	2
k-apices of minor-closed graph classes. I. Bounding the obstructions	2
Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions	2
A unified view of inequalities for distance-regular graphs, part I	2
Polynomial χ-binding functions for t-broom-free graphs	2
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes	2
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs	2
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	2
Quantum isomorphism of graphs from association schemes	2
Erdős-Hajnal for cap-free graphs	2
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	2
Packing and covering immersions in 4-edge-connected graphs	2
On the spectrum of Hamiltonian cycles in the n-cube	2
The excluded minors for 2- and 3-regular matroids	2
Chromatic index of dense quasirandom graphs	2
Excluding a planar matching minor in bipartite graphs	2
A Menger-like property of tree-cut width	2
Global rigidity of direction-length frameworks	2
Relating the cut distance and the weak* topology for graphons	2
The structure of claw-free binary matroids	2
N-detachable pairs in 3-connected matroids III: The theorem	2
Jordan-like characterization of automorphism groups of planar graphs	2
Extremal problems for multigraphs	2
Stability of graph pairs	2
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation	2
Sharp bounds for the chromatic number of random Kneser graphs	2
The templates for some classes of quaternary matroids	2
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs	2
Structure in sparse k-critical graphs	2
Counting Hamiltonian cycles in planar triangulations	2
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies	2

Maker-breaker percolation games II: Escaping to infinity	2
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza	2
Every graph is eventually Turán-good	2
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure	2
Typical and extremal aspects of friends-and-strangers graphs	2
Graphs with polynomially many minimal separators	2
Dirac-type conditions for spanning bounded-degree hypertrees	2
Triangle resilience of the square of a Hamilton cycle in random graphs	2
Counting r-graphs without forbidden configurations	1
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph	1
On primitive 2-closed permutation groups of rank at most four	1
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching	1
Twin-width can be exponential in treewidth	1
K4-intersecting families of graphs	1
Turán problems for mixed graphs	1
Globally rigid powers of graphs	1
Packing A-paths of length zero modulo a prime	1
Clean tangled clutters, simplices, and projective geometries	1
On Vizing's edge colouring question	1
Enlarging vertex-flames in countable digraphs	1
The Erdős-Gyárfás function f(n,4<	1
Edge-colouring graphs with local list sizes	1
3-List-coloring graphs of girth at least five on surfaces	1
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs	1
Cycles of a given length in tournaments	1
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	1
Graphs of bounded twin-width are quasi-polynomially χ-bounded	1
Tight bounds for divisible subdivisions	1
Gray codes and symmetric chains	1
Turán graphs with bounded matching number	1
Nowhere-zero 3-flows in toroidal graphs	1
On sensitivity in bipartite Cayley graphs	1
On a recolouring version of Hadwiger's conjecture	1
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture	1
Optimal oriented diameter of graphs with diameter 3	1
The immersion-minimal infinitely edge-connected graph	1
The maximum number of copies of an even cycle in a planar graph	1
One-to-one correspondence between interpretations of the Tutte polynomials	1
Extremal graphs for the Tutte polynomial	1
On the central levels problem	1
Long cycles, heavy cycles and cycle decompositions in digraphs	1
A critical probability for biclique partition of G,	1
Ramsey number of 1-subdivisions of transitive tournaments	1
On a problem of El-Zahar and Erdős	1
Boundary rigidity of CAT(0) cube complexes	1
Determining triangulations and quadrangulations by boundary distances	1
Overfullness of critical class 2 graphs with a small core degree	1
Proper orientations and proper chromatic number	1
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]	1
The feasible region of induced graphs	1
Common graphs with arbitrary connectivity and chromatic number	1
The Lovász-Cherkassky theorem in countable graphs	1
A note on classes of subgraphs of locally finite graphs	1
Hypergraph Turán densities can have arbitrarily large algebraic degree	1
Rooted topological minors on four vertices	1
Unavoidable hypergraphs	1
Asymptotic density of graphs excluding disconnected minors	1
Efficiently distinguishing all tangles in locally finite graphs	1
An explicit characterization of arc-transitive circulants	1
The interval number of a planar graph is at most three	1
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	1
Ramsey numbers of path-matchings, covering designs, and 1-cores	1
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	1
Pure pairs. IV. Trees in bipartite graphs	1
The Ramsey number of a long even cycle versus a star	1
Binary scalar products	1
On the hat guessing number of a planar graph class	1
Excluded minors for the Klein bottle I. Low connectivity case	1
Induced paths in graphs without anticomplete cycles	1
Extended commonality of paths and cycles via Schur convexity	1
On Andreae's ubiquity conjecture	1
On the coequal values of total chromatic number and chromatic index	1
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	1
Reconstructing the degree sequence of a sparse graph from a partial deck	1
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	1
Counting colorings of triangle-free graphs	1
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix	1
Finite 3-connected-set-homogeneous locally 2K graphs and s-arc-transitive graphs	1
Extremal problems for pairs of triangles	1
How connectivity affects the extremal number of trees	1
Two Erdős–Hajnal-type theorems in hypergraphs	1
Countably determined ends and graphs	1
Entanglements	1
Some extremal results on 4-cycles	1
A simple proof of the Map Color Theorem for nonorientable surfaces	1
The burning number conjecture holds asymptotically	1