Journal of Graph Theory

Article	Citations
On Turán problems with bounded matching number	12
Heroes in oriented complete multipartite graphs	12
	11
Connected search for a lazy robber	11
On a generalized Erdős–Rademacher problem	9
Adaptable and conflict colouring multigraphs with no cycles of length three or four	9
Bounding the tripartite‐circle crossing number of complete tripartite graphs	9
	9
Equitable oriented coloring	9
On the saturation spectrum of odd cycles	8
Issue Information	8
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles	8
Turán numbers for disjoint paths	8
	8
Planar Legendrian Θ ${\rm{\Theta }}$‐graphs	7
The extremal average distance of cubic graphs	7
Modularity of minor‐free graphs	7
Forest formulas of discrete Green's functions	7
Local orthogonality dimension	7
Large monochromatic components of small diameter	6
Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator	6
Proof of a conjecture of Plummer and Zha	6
Issue Information	6
Independent set and matching permutations	6
	6

Signed colouring and list colouring of k‐chromatic graphs	6
Tree embeddings and tree‐star Ramsey numbers	6
	6
	6
Even A‐cycles have the edge‐Erdős–Pósa property	6
Classifying intrinsically linked tournaments by score sequence	6
	5
Highly edge‐connected regular graphs without large factorizable subgraphs	5
Longest cycles in 3‐connected hypergraphs and bipartite graphs	5
	5
Good acyclic orientations of 4‐regular 4‐connected graphs	5
Chromatic λ‐choosable and λ‐paintable graphs	5
Issue Information	5
Degree sum conditions for the existence of homeomorphically irreducible spanning trees	5
Find subtrees of specified weight and cycles of specified length in linear time	4
Kempe equivalence of 4‐critical planar graphs	4
A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space	4
Counting hypergraphs with large girth	4
On the extremal function for graph minors	4
On Seymour's and Sullivan's second neighbourhood conjectures	4
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection	4
Issue Information	4
Asymptotically good edge correspondence colourings	4
On construction for trees making the equality hold in Vizing's conjecture	4
Turán number for odd‐ballooning of trees	4
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration	4
A new graph parameter to measure linearity	4
Critical properties of bipartite permutation graphs	4
Decreasing the mean subtree order by adding k edges	4
Packing of spanning mixed arborescences	3
Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs	3
Oriented discrepancy of Hamilton cycles	3
Oriented diameter of maximal outerplanar graphs	3
Seurat games on Stockmeyer graphs	3
Highly connected triples and Mader's conjecture	3
Finding dense minors using average degree	3
On bisections of graphs without complete bipartite graphs	3
Issue Information	3
The connectivity of the dual	3
Greedoids from flames	3
Triangles in C5‐free graphs and hypergraphs of girth six	3
On the mean subtree order of trees under edge contraction	3
The edge‐connectivity of vertex‐transitive hypergraphs	3
A Construction of a 3/2‐Tough Plane Triangulation With No 2‐Factor	3
	3
Removable edges in near‐bipartite bricks	3
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result	3
Fractional factors and component factors in graphs with isolated toughness smaller than 1	3
Erdös–Hajnal conjecture for new infinite families of tournaments	3
Symmetries of the honeycomb toroidal graphs	3

On the edge‐biclique graph and the iterated edge‐biclique operator	3
Revisiting semistrong edge‐coloring of graphs	3
Minimum degree stability of C2k+1 ${C}_{2k+1}$‐free graphs	3
Integer flows on triangularly connected signed graphs	3
Edge‐transitive cubic graphs of twice square‐free order	3
Issue Information	3
Equitable List Coloring of Planar Graphs With Given Maximum Degree	3
Exact bipartite Turán numbers of large even cycles	3
On the order of antipodal covers	3
Kings in multipartite hypertournaments	2
Sparse halves in K4‐free graphs	2
Issue Information	2
Antimagic orientation of graphs with minimum degree at least 33	2
Inducibility in the hypercube	2
Large cycles in generalized Johnson graphs	2
Subdivisions with congruence constraints in digraphs of large chromatic number	2
	2
Graphs with the unique path property: Structure, cycles, factors, and constructions	2
Contractible edges in longest cycles	2
Graphs with girth 2ℓ+1 $2\ell +1$ and without longer odd holes are 3‐colorable	2
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems	2
Rainbow independent sets in certain classes of graphs	2
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs	2
Erratum: The 2‐surviving rate of planar graphs with average degree lower than 92	2
On oriented m $m$‐semiregular representations of finite groups	2
Between proper and strong edge‐colorings of subcubic graphs	2
Making an H $H$‐free graph k $k$‐colorable	2
Isoradial immersions	2
Issue Information	2
Sharp threshold for embedding balanced spanning trees in random geometric graphs	2
Exact values for some unbalanced Zarankiewicz numbers	2
On asymptotic packing of convex geometric and ordered graphs	2
On two cycles of consecutive even lengths	2
Hamilton‐connected {claw, bull}‐free graphs	2
Issue Information	2
Face distributions of embeddings of complete graphs	2
Partitioning edges of a planar graph into linear forests and a matching	2
Complete directed minors and chromatic number	2
Minimal bricks with the maximum number of edges	2
Two disjoint cycles in digraphs	2
Hamilton‐connected {claw,net}‐free graphs, II	2
On the Ubiquity of Oriented Double Rays	2
A graph polynomial from chromatic symmetric functions	2
Tight Upper Bound on the Clique Size in the Square of 2‐Degenerate Graphs	2
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$	2
A proof of Frankl–Kupavskii's conjecture on edge‐union condition	2
Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree	2
C10 Has Positive Turán Density in the Hypercube	2
Erdős–Pósa property of obstructions to interval graphs	2
Maximum diameter of 3‐ and 4‐colorable graphs	2
Random polynomial graphs for random Turán problems	2
Issue Information	2
	2
Interval colorings of graphs—Coordinated and unstable no‐wait schedules	2
Circular coloring and fractional coloring in planar graphs	2
On Stahl's conjectures about the region distributions of bouquets	2
Towards Nash‐Williams orientation conjecture for infinite graphs	2
Defective acyclic colorings of planar graphs	2
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	1
	1
Andrásfai and Vega graphs in Ramsey–Turán theory	1
Issue Information	1
Improved bounds for the oriented radius of mixed multigraphs	1
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width	1
The strong clique index of a graph with forbidden cycles	1
Meyniel's conjecture on graphs of bounded degree	1
Threshold for stability of weak saturation	1
Issue Information	1
Maximum spectral radius of outerplanar 3‐uniform hypergraphs	1
	1
On graphs for which large books are Ramsey good	1
Ramsey numbers of the quadrilateral versus books	1
Wreath product in automorphism groups of graphs	1
Breaking small automorphisms by list colourings	1
Local version of Vizing's theorem for multigraphs	1
The product structure of squaregraphs	1
A density bound for triangle‐free 4‐critical graphs	1
All longest cycles in a 2‐connected partial 3‐tree share a common vertex	1
Partitioning kite‐free planar graphs into two forests	1
Disjoint total dominating sets in near‐triangulations	1

	1
On the number of star‐shaped classes in optimal colorings of Kneser graphs	1
Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$	1
Supereulerian regular matroids without small cocircuits	1
A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs	1
4‐Separations in Hajós graphs	1
Coloring count cones of planar graphs	1
Nonabelian flows in networks	1
Bounding the mim‐width of hereditary graph classes	1
Locally common graphs	1
Distinguishing infinite graphs with bounded degrees	1
Chromatic number is Ramsey distinguishing	1
	1
The list linear arboricity of graphs	1
	1
Exact Results for Generalized Extremal Problems Forbidding an Even Cycle	1
Perfect matchings in highly cyclically connected regular graphs	1
Issue Information	1
Short rainbow cycles for families of matchings and triangles	1
Planar graphs having no cycle of length 4, 7, or 9 are DP‐3‐colorable	1
The (t−1) $(t-1)$‐chromatic Ramsey number for paths	1
Issue Information	1
Bounds on Ramsey games via alterations	1
Counting connected partitions of graphs	1
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings	1
Independence number of edge‐chromatic critical graphs	1
Corrigendum: The diameter of AT‐free graphs	1
A tight bound for independent domination of cubic graphs without 4‐cycles	1
Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph	1
On independent domination of regular graphs	1
A tight upper bound on the average order of dominating sets of a graph	1
The average order of a connected induced subgraph of a graph and union‐intersection systems	1
Gallai‐like characterization of strong cocomparability graphs	1
Uniformly 3‐connected graphs	1
Ubiquity of oriented rays	1
A decomposition method on solving the linear arboricity conjecture	1
Issue Information	1
Mader's conjecture for graphs with small connectivity	1
Forbidden subgraphs and 2‐factors in 3/2‐tough graphs	1
Multiplicity of  the second‐largest eigenvalue of a planar graph	1
Star transposition Gray codes for multiset permutations	1
Making a tournament k $k$‐strong	1
Issue Information	1
Distinguishing threshold of graphs	1
On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza	1
Issue Information	1
The maximum number of maximum generalized 4‐independent sets in trees	1
The Erdős–Gyárfás function with respect to Gallai‐colorings	1
Elusive properties of infinite graphs	1
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs	1
	1
Flip distance and triangulations of a polyhedron	1
Maker Breaker on digraphs	1
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs	1
Odd edge‐colorings of subdivisions of odd graphs	1
Strong arc decompositions of split digraphs	1
Variants of the Gyárfás–Sumner conjecture: Oriented trees and rainbow paths	1
Double Vizing fans in critical class two graphs	1
Stability from graph symmetrization arguments in generalized Turán problems	1
Removal of subgraphs and perfect matchings in graphs on surfaces	1
A bound on the dissociation number	1
Weak degeneracy of graphs	1
Turán and Ramsey numbers for 3‐uniform minimal paths of length 4	1
Issue Information	1
Dense circuit graphs and the planar Turán number of a cycle	1
Issue Information	1
Strong chromatic index and Hadwiger number	1
Edge proximity conditions for extendability in regular bipartite graphs	1
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers	1
Berge–Fulkerson coloring for C(12)‐linked permutation graphs	1
Complementary cycles of any length in regular bipartite tournaments	1
	1