Journal of Combinatorial Theory Series B

Article	Citations
Edge-transitive bi-Cayley graphs	25
Generalized Turán problems for even cycles	21
The 1–2–3 Conjecture almost holds for regular graphs	19
Planar graphs that need four pages	18
Towards tight(er) bounds for the Excluded Grid Theorem	16
Colouring graphs with sparse neighbourhoods: Bounds and applications	13
Hamiltonicity in randomly perturbed hypergraphs	13
Towards the linear arboricity conjecture	12
The inverse eigenvalue problem of a graph: Multiplicities and minors	12
A Harary-Sachs theorem for hypergraphs	11
The Alon-Tarsi number of a planar graph minus a matching	11
The multicolour size-Ramsey number of powers of paths	11
The Erdős Matching Conjecture and concentration inequalities	11
The hat guessing number of graphs	10
Cuboids, a class of clutters	10
On the rational Turán exponents conjecture	10
Constructions of new q-cryptomorphisms	9
The number of Gallai k-colorings of complete graphs	9
Simple k-planar graphs are simple (k + 1)-quasiplanar	9
Extremal graphs for edge blow-up of graphs	9
Subdivisions of digraphs in tournaments	9
Decompositions into isomorphic rainbow spanning trees	8
Completion and deficiency problems	8
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait	8
Erdős-Pósa property of chordless cycles and its applications	7

Most Laplacian eigenvalues of a tree are small	7
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five	7
Clustered variants of Hajós' conjecture	7
Maximum degree and diversity in intersecting hypergraphs	7
A scaling limit for the length of the longest cycle in a sparse random graph	7
Reconfiguring colorings of graphs with bounded maximum average degree	7
On the cop number of toroidal graphs	7
Approximating infinite graphs by normal trees	7
Connectivity and choosability of graphs with no K minor	6
Total weight choosability of graphs: Towards the 1-2-3-conjecture	6
Dichromatic number and forced subdivisions	6
On Hamiltonian cycles in hypergraphs with dense link graphs	6
Canonical trees of tree-decompositions	6
Cubic graphs that cannot be covered with four perfect matchings	6
Graph functionality	6
The inverse Kazhdan-Lusztig polynomial of a matroid	6
Minimum degree conditions for monochromatic cycle partitioning	6
Graph product structure for non-minor-closed classes	6
Density of C−4-critical signed graphs	6
Relatively small counterexamples to Hedetniemi's conjecture	6
The structure of hypergraphs without long Berge cycles	6
Clique immersion in graphs without a fixed bipartite graph	6
An average degree condition for independent transversals	6
On the existence of graphical Frobenius representations and their asymptotic enumeration	6
Circular flows via extended Tutte orientations	6
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	5
The Turán number of blow-ups of trees	5
The (theta, wheel)-free graphs Part IV: Induced paths and cycles	5
Obstructions for bounded shrub-depth and rank-depth	5
Stability for vertex isoperimetry in the cube	5
The evolution of the structure of ABC-minimal trees	5
On the lower bound of the sum of the algebraic connectivity of a graph and its complement	5
Sparse hypergraphs: New bounds and constructions	5
Flows on flow-admissible signed graphs	5
Edge-critical subgraphs of Schrijver graphs	5
Induced subgraphs of graphs with large chromatic number. VI. Banana trees	5
On the chromatic number of disjointness graphs of curves	5
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings	5
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs	5
The feasible region of hypergraphs	5
K-factors in graphs with low independence number	5
Turán problems for edge-ordered graphs	5
The Grid Theorem for vertex-minors	5
A polynomial version of Cereceda's conjecture	5
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
On the spectral gap and the automorphism group of distance-regular graphs	4
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies	4
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs	4
A unified existence theorem for normal spanning trees	4

Progress towards Nash-Williams' conjecture on triangle decompositions	4
The Kelmans-Seymour conjecture IV: A proof	4
Regular Cayley maps for dihedral groups	4
Bounding χ by a fraction of Δ for graphs without large cliques	4
Grid induced minor theorem for graphs of small degree	4
Polynomial bounds for centered colorings on proper minor-closed graph classes	4
Tangles and the Stone-Čech compactification of infinite graphs	4
Super-pancyclic hypergraphs and bipartite graphs	4
The Kelmans-Seymour conjecture III: 3-vertices in K4	4
The Kelmans-Seymour conjecture II: 2-Vertices in K4	4
An asymptotic resolution of a problem of Plesník	4
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture	4
On edge-primitive 3-arc-transitive graphs	4
Disjoint isomorphic balanced clique subdivisions	4
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs	4
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture	4
The domination number of plane triangulations	4
The Kelmans-Seymour conjecture I: Special separations	4
A proof of the upper matching conjecture for large graphs	3
How to build a pillar: A proof of Thomassen's conjecture	3
Hedetniemi's conjecture is asymptotically false	3
On a conjecture of spectral extremal problems	3
On Schelp's problem for three odd long cycles	3
N-detachable pairs in 3-connected matroids II: Life in X	3
Characterising k-connected sets in infinite graphs	3
Spanning trees in dense directed graphs	3
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers	3
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	3
A solution of Li-Xia's problem on s-arc-transitive solvable Cayley graphs	3
Canonical double covers of circulants	3
On the average degree of edge chromatic critical graphs II	3
Every nice graph is (1,5)-choosable	3
Many cliques with few edges and bounded maximum degree	3
On the average degree of edge chromatic critical graphs	3
Gaps in the cycle spectrum of 3-connected cubic planar graphs	3
The multicolor size-Ramsey numbers of cycles	3
A counterexample to prism-hamiltonicity of 3-connected planar graphs	3
A fast distributed algorithm for (Δ + 1)-edge-coloring	3
Global rigidity of periodic graphs under fixed-lattice representations	3
Erdős-Hajnal-type results for monotone paths	3
Contact graphs of ball packings	3
Edge-critical subgraphs of Schrijver graphs II: The general case	3
Dismantlability, connectedness, and mixing in relational structures	3
Degeneracy of P-free and C⩾-free graphs with no large complete bipartite subgraphs	3
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm	3
A lower bound on the average size of a connected vertex set of a graph	3
Jumps in speeds of hereditary properties in finite relational languages	3
A new bound for the Brown–Erdős–Sós problem	3
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true	3
A localization method in Hamiltonian graph theory	3
Corrigendum to “Bisimplicial vertices in even-hole-free graphs”	3
Tilings in vertex ordered graphs	3
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza	2
Relating the cut distance and the weak* topology for graphons	2
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs	2
Embedding clique-factors in graphs with low ℓ-independence number	2
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring	2
Typical and extremal aspects of friends-and-strangers graphs	2
Extremal graphs for the Tutte polynomial	2
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	2
A unified approach to hypergraph stability	2
On the spectrum of Hamiltonian cycles in the n-cube	2
Packing and covering immersions in 4-edge-connected graphs	2
Counting Hamiltonian cycles in planar triangulations	2
Global rigidity of direction-length frameworks	2
The structure of claw-free binary matroids	2
N-detachable pairs in 3-connected matroids III: The theorem	2
The generalised Oberwolfach problem	2
Erdős-Hajnal for cap-free graphs	2
Local 2-separators	2
Dirac-type theorems in random hypergraphs	2
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching	2
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs	2
Discrepancies of spanning trees and Hamilton cycles	2
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs	2
The excluded minors for 2- and 3-regular matroids	2
Gray codes and symmetric chains	2
Immersion and clustered coloring	2
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes	2
Even-hole-free graphs still have bisimplicial vertices	2

Extremal problems for multigraphs	2
Stability of graph pairs	2
Jordan-like characterization of automorphism groups of planar graphs	2
Sharp bounds for the chromatic number of random Kneser graphs	2
The templates for some classes of quaternary matroids	2
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree	2
Topological ubiquity of trees	2
On the Cayleyness of Praeger-Xu graphs	2
Evaluations of Tutte polynomials of regular graphs	2
Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions	2
Globally rigid powers of graphs	1
Ranking tournaments with no errors II: Minimax relation	1
K4-intersecting families of graphs	1
A Stallings type theorem for quasi-transitive graphs	1
Asymptotic density of graphs excluding disconnected minors	1
A unified view of inequalities for distance-regular graphs, part I	1
On a perfect matching in a random digraph with average out-degree below two	1
The feasible region of induced graphs	1
A note on classes of subgraphs of locally finite graphs	1
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	1
k-apices of minor-closed graph classes. I. Bounding the obstructions	1
Proper orientations and proper chromatic number	1
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	1
2-factors with k cycles in Hamiltonian graphs	1
Some extremal results on 4-cycles	1
On the unavoidability of oriented trees	1
Matroid fragility and relaxations of circuit hyperplanes	1
Structure in sparse k-critical graphs	1
Induced paths in graphs without anticomplete cycles	1
Packing A-paths of length zero modulo a prime	1
Cycles containing all the odd-degree vertices	1
Pure pairs. IV. Trees in bipartite graphs	1
Long cycles, heavy cycles and cycle decompositions in digraphs	1
Excluded minors for the Klein bottle I. Low connectivity case	1
Extremal problems for pairs of triangles	1
The Lovász-Cherkassky theorem in countable graphs	1
Cycles of a given length in tournaments	1
Enlarging vertex-flames in countable digraphs	1
Stability and exact Turán numbers for matroids	1
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]	1
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k	1
Packing cycles in undirected group-labelled graphs	1
Graphs with polynomially many minimal separators	1
Entanglements	1
Almost all optimally coloured complete graphs contain a rainbow Hamilton path	1
Optimal oriented diameter of graphs with diameter 3	1
Two Erdős–Hajnal-type theorems in hypergraphs	1
Unavoidable hypergraphs	1
A Menger-like property of tree-cut width	1
Chromatic index of dense quasirandom graphs	1
Ramsey numbers of path-matchings, covering designs, and 1-cores	1
On the hat guessing number of a planar graph class	1
On primitive 2-closed permutation groups of rank at most four	1
Ramsey number of 1-subdivisions of transitive tournaments	1
Binary scalar products	1
Clean tangled clutters, simplices, and projective geometries	1
Maker-breaker percolation games II: Escaping to infinity	1
Reconstructing the degree sequence of a sparse graph from a partial deck	1
On the coequal values of total chromatic number and chromatic index	1
Countably determined ends and graphs	1
Overfullness of critical class 2 graphs with a small core degree	1
Graphs of bounded twin-width are quasi-polynomially χ-bounded	1
The (theta, wheel)-free graphs Part II: Structure theorem	1
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three	1
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix	1
A simple proof of the Map Color Theorem for nonorientable surfaces	1
3-List-coloring graphs of girth at least five on surfaces	1
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture	1
Rooted topological minors on four vertices	1
Finding a path with two labels forbidden in group-labeled graphs	1
The interval number of a planar graph is at most three	1
k-regular subgraphs near the k-core threshold of a random graph	1
One-to-one correspondence between interpretations of the Tutte polynomials	1
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation	1
On the central levels problem	1