Journal of Graph Theory

Article	Citations
Connected search for a lazy robber	13
On Turán problems with bounded matching number	13
	12
	11
Bounding the tripartite‐circle crossing number of complete tripartite graphs	11
Critical properties of bipartite permutation graphs	9
Issue Information	9
	9
Forest formulas of discrete Green's functions	9
Local orthogonality dimension	9
	9
Issue Information	8
Issue Information	8
Longest cycles in 3‐connected hypergraphs and bipartite graphs	8
Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs	8
	8
	8
	8
Issue Information	7
Degree sum conditions for the existence of homeomorphically irreducible spanning trees	7
Counting hypergraphs with large girth	7
Packing of spanning mixed arborescences	7
Independent Sets of Random Trees and Sparse Random Graphs	7
Good acyclic orientations of 4‐regular 4‐connected graphs	7
Fractional factors and component factors in graphs with isolated toughness smaller than 1	6

	6
Asymptotically good edge correspondence colourings	6
Greedoids from flames	6
The connectivity of the dual	6
Issue Information	6
Symmetries of the honeycomb toroidal graphs	6
On the extremal function for graph minors	6
On the Ubiquity of Oriented Double Rays	6
Towards Nash‐Williams orientation conjecture for infinite graphs	6
Issue Information	6
Signed colouring and list colouring of k‐chromatic graphs	6
Chromatic λ‐choosable and λ‐paintable graphs	6
Oriented diameter of maximal outerplanar graphs	5
Erdös–Hajnal conjecture for new infinite families of tournaments	5
Turán numbers for disjoint paths	5
On the edge‐biclique graph and the iterated edge‐biclique operator	5
Find subtrees of specified weight and cycles of specified length in linear time	5
On construction for trees making the equality hold in Vizing's conjecture	5
Exact bipartite Turán numbers of large even cycles	5
Kempe equivalence of 4‐critical planar graphs	5
On bisections of graphs without complete bipartite graphs	5
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration	5
Highly connected triples and Mader's conjecture	4
A new graph parameter to measure linearity	4
Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator	4
Even A‐cycles have the edge‐Erdős–Pósa property	4
Removable edges in near‐bipartite bricks	4
Finding dense minors using average degree	4
A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space	4
Defective acyclic colorings of planar graphs	4
Heroes in oriented complete multipartite graphs	4
On Seymour's and Sullivan's second neighbourhood conjectures	4
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result	4
Equitable oriented coloring	4
Oriented discrepancy of Hamilton cycles	3
Large monochromatic components of small diameter	3
On a generalized Erdős–Rademacher problem	3
On the mean subtree order of trees under edge contraction	3
Edge‐transitive cubic graphs of twice square‐free order	3
The extremal average distance of cubic graphs	3
Revisiting semistrong edge‐coloring of graphs	3
Planar Legendrian Θ ${\rm{\Theta }}$‐graphs	3
On the order of antipodal covers	3
The edge‐connectivity of vertex‐transitive hypergraphs	3
Triangles in C5‐free graphs and hypergraphs of girth six	3
Seurat games on Stockmeyer graphs	3
Proof of a conjecture of Plummer and Zha	3
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection	3
A Construction of a 3/2‐Tough Plane Triangulation With No 2‐Factor	3
Minimum degree stability of C2k+1 ${C}_{2k+1}$‐free graphs	3

Integer flows on triangularly connected signed graphs	3
Turán number for odd‐ballooning of trees	3
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles	3
Modularity of minor‐free graphs	3
Highly edge‐connected regular graphs without large factorizable subgraphs	3
Independent set and matching permutations	3
Classifying intrinsically linked tournaments by score sequence	3
Tree embeddings and tree‐star Ramsey numbers	3
On the saturation spectrum of odd cycles	3
Decreasing the mean subtree order by adding k edges	3
Adaptable and conflict colouring multigraphs with no cycles of length three or four	3
On oriented m $m$‐semiregular representations of finite groups	3
Making an H $H$‐free graph k $k$‐colorable	2
Inducibility in the hypercube	2
Ubiquity of oriented rays	2
Minimal bricks with the maximum number of edges	2
Corrigendum: The diameter of AT‐free graphs	2
Issue Information	2
Contractible edges in longest cycles	2
Rainbow independent sets in certain classes of graphs	2
Erratum: The 2‐surviving rate of planar graphs with average degree lower than 92	2
Exact Results for Generalized Extremal Problems Forbidding an Even Cycle	2
Distinguishing threshold of graphs	2
	2
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs	2
The list linear arboricity of graphs	2
Isoradial immersions	2
Threshold for stability of weak saturation	2
Circular coloring and fractional coloring in planar graphs	2
Issue Information	2
Sparse halves in K4‐free graphs	2
Equitable List Coloring of Planar Graphs With Given Maximum Degree	2
Dense circuit graphs and the planar Turán number of a cycle	2
Planar graphs having no cycle of length 4, 7, or 9 are DP‐3‐colorable	2
Random polynomial graphs for random Turán problems	2
Strong arc decompositions of split digraphs	2
	2
On two cycles of consecutive even lengths	2
Tight Upper Bound on the Clique Size in the Square of 2‐Degenerate Graphs	2
On graphs for which large books are Ramsey good	2
Graphs with the unique path property: Structure, cycles, factors, and constructions	2
Locally common graphs	2
Issue Information	2
Complete directed minors and chromatic number	2
Issue Information	2
Mader's conjecture for graphs with small connectivity	2
Issue Information	2
Antimagic orientation of graphs with minimum degree at least 33	2
The strong clique index of a graph with forbidden cycles	2
Independence number of edge‐chromatic critical graphs	2
Distribution of Vertices Required a High‐Degree Condition on Partitions of Graphs Under Degree Constraints	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
Issue Information	2
Erdős–Pósa property of obstructions to interval graphs	2
Kings in multipartite hypertournaments	2
Graphs with girth 2ℓ+1 $2\ell +1$ and without longer odd holes are 3‐colorable	2
A graph polynomial from chromatic symmetric functions	2
Counting connected partitions of graphs	2
Chromatic number is Ramsey distinguishing	2
A proof of Frankl–Kupavskii's conjecture on edge‐union condition	2
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	2
Complementary cycles of any length in regular bipartite tournaments	2
Between proper and strong edge‐colorings of subcubic graphs	2
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs	2
Coloring count cones of planar graphs	2
Flip distance and triangulations of a polyhedron	2
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs	2
Polynomial Characterizations of Distance‐Biregular Graphs	1
Issue Information	1
	1
Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors	1
	1
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width	1
Weak degeneracy of graphs	1
Maker Breaker on digraphs	1
Issue Information	1
Ramsey numbers of large books	1
	1
Extremal graphs for odd wheels	1

The maximum number of maximum generalized 4‐independent sets in trees	1
Uniformly 3‐connected graphs	1
Maximum spectral radius of outerplanar 3‐uniform hypergraphs	1
Spanning eulerian subdigraphs in semicomplete digraphs	1
Strong chromatic index and Hadwiger number	1
Local version of Vizing's theorem for multigraphs	1
Maximum diameter of 3‐ and 4‐colorable graphs	1
On the number of star‐shaped classes in optimal colorings of Kneser graphs	1
Issue Information	1
A tight upper bound on the average order of dominating sets of a graph	1
Double Vizing fans in critical class two graphs	1
Large cycles in generalized Johnson graphs	1
A tight bound for independent domination of cubic graphs without 4‐cycles	1
Subdivisions with congruence constraints in digraphs of large chromatic number	1
Two disjoint cycles in digraphs	1
Eigenvalues and cycles of consecutive lengths	1
	1
Exact values for some unbalanced Zarankiewicz numbers	1
Ramsey numbers upon vertex deletion	1
Issue Information	1
Improved bounds for the oriented radius of mixed multigraphs	1
Issue Information	1
	1
Balanced supersaturation for some degenerate hypergraphs	1
Perfect matchings in highly cyclically connected regular graphs	1
Andrásfai and Vega graphs in Ramsey–Turán theory	1
Berge–Fulkerson coloring for C(12)‐linked permutation graphs	1
Partitioning digraphs with outdegree at least 4	1
Gallai‐like characterization of strong cocomparability graphs	1
On the maximum number of odd cycles in graphs without smaller odd cycles	1
	1
4‐Separations in Hajós graphs	1
Reconfiguration of connected graph partitions	1
Making a tournament k $k$‐strong	1
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable	1
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2	1
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$	1
Ramsey numbers of the quadrilateral versus books	1
Enumerative problems for arborescences and monotone paths on polytope graphs	1
Supereulerian regular matroids without small cocircuits	1
Forbidden subgraphs and 2‐factors in 3/2‐tough graphs	1
Odd edge‐colorings of subdivisions of odd graphs	1
Issue Information	1
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems	1
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers	1
Wreath product in automorphism groups of graphs	1
Interval colorings of graphs—Coordinated and unstable no‐wait schedules	1
The average order of a connected induced subgraph of a graph and union‐intersection systems	1
Directed Graphs Without Rainbow Triangles	1
Nonabelian flows in networks	1
The structure of graphs with no W4 immersion	1
Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$	1
Partitioning edges of a planar graph into linear forests and a matching	1
Directed Steiner tree packing and directed tree connectivity	1
Star transposition Gray codes for multiset permutations	1
Turán and Ramsey numbers for 3‐uniform minimal paths of length 4	1
A decomposition method on solving the linear arboricity conjecture	1
Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph	1
Issue Information	1
	1
Stability from graph symmetrization arguments in generalized Turán problems	1
Meyniel's conjecture on graphs of bounded degree	1
Ramsey numbers of trails and circuits	1
The Erdős–Gyárfás function with respect to Gallai‐colorings	1
Distinguishing infinite graphs with bounded degrees	1
Polyhedra without cubic vertices are prism‐hamiltonian	1
A variant of the Erdős–Rényi random graph process	1
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings	1
A density bound for triangle‐free 4‐critical graphs	1
The (t−1) $(t-1)$‐chromatic Ramsey number for paths	1
Issue Information	1
All longest cycles in a 2‐connected partial 3‐tree share a common vertex	1
Hamilton‐connected {claw, bull}‐free graphs	1
A note on Goldberg's conjecture on total chromatic numbers	1
	1
Hamilton‐connected {claw,net}‐free graphs, II	1
Edge proximity conditions for extendability in regular bipartite graphs	1
On asymptotic packing of convex geometric and ordered graphs	1
Bounds on Ramsey games via alterations	1
On independent domination of regular graphs	1
A bound on the dissociation number	1
Edge coloring graphs with large minimum degree	1
Issue Information	1
On Stahl's conjectures about the region distributions of bouquets	1
Rainbow structures in a collection of graphs with degree conditions	1
	1
Sharp threshold for embedding balanced spanning trees in random geometric graphs	1
Issue Information	1