Journal of Graph Theory

Article	Citations
On the mean subtree order of trees under edge contraction	26
Issue Information	15
	14
Maximal Spectral Radius of Minimally k‐(Edge)‐Connected Graphs	13
Counterexamples Regarding Linked and Lean Tree‐Decompositions of Infinite Graphs	12
The Generic Circular Triangle‐Free Graph	12
Revisiting semistrong edge‐coloring of graphs	11
Counting hypergraphs with large girth	11
Decreasing the mean subtree order by adding k edges	10
Minimum degree stability of C2k+1 ${C}_{2k+1}$‐free graphs	10
Asymptotically good edge correspondence colourings	10
Erdös–Hajnal conjecture for new infinite families of tournaments	9
Issue Information	9
Making an H $H$‐free graph k $k$‐colorable	9
Maximum diameter of 3‐ and 4‐colorable graphs	9
Two disjoint cycles in digraphs	8
On asymptotic packing of convex geometric and ordered graphs	8
Wreath product in automorphism groups of graphs	8
On independent domination of regular graphs	7
Minimal bricks with the maximum number of edges	7
Ubiquity of oriented rays	7
Distribution of Vertices Required a High‐Degree Condition on Partitions of Graphs Under Degree Constraints	7
On Stahl's conjectures about the region distributions of bouquets	7
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs	7
C10 Has Positive Turán Density in the Hypercube	7

Gallai‐like characterization of strong cocomparability graphs	6
Supereulerian regular matroids without small cocircuits	6
Erdős–Pósa property of obstructions to interval graphs	6
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems	6
Mader's conjecture for graphs with small connectivity	6
	5
On a conjecture that strengthens Kundu's k <math xmlns="http://www.w3.org/1998/Math/MathML" altimg="urn:x-wiley:03649024:media:jgt23177:jgt23177-math-0001" wiley:location="equation/jgt23177-math-00	5
	5
Removal of subgraphs and perfect matchings in graphs on surfaces	5
DP color functions versus chromatic polynomials (II)	5
Ramsey numbers of large books	5
Two Stability Theorems for Kℓ+1r‐Saturated Hypergraphs	5
	5
Cliques in squares of graphs with maximum average degree less than 4	5
	5
	5
Reconfiguration of connected graph partitions	5
Face‐simple minimal quadrangulations of surfaces	4
Extremal Results on Conflict‐Free Coloring	4
Rainbow structures in a collection of graphs with degree conditions	4
	4
Issue Information	4
Signed Graphs, Nonorientable Surfaces, and Integer Flows	4
Triangle‐free graphs with large chromatic number and no induced wheel	4
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph	4
Ramsey numbers for multiple copies of sparse graphs	4
The Polynomial Method for Three‐Path Extendability of List Colourings of Planar Graphs	4
Short rainbow cycles for families of matchings and triangles	4
On deeply critical oriented cliques	4
On Tournament Inversion	4
Gallai–Ramsey number for K5 ${K}_{5}$	4
	4
On λ $\lambda $‐backbone coloring of cliques with tree backbones in linear time	4
The average degree of edge chromatic critical graphs with maximum degree seven	4
On coloring digraphs with forbidden induced subgraphs	4
Multicolor list Ramsey numbers grow exponentially	4
Clique‐width: Harnessing the power of atoms	4
On a Norine–Thomas conjecture concerning minimal bricks	4
Acyclic graphs with at least 2ℓ + 1 vertices are ℓ‐recognizable	4
Counting triangles in regular graphs	4
Issue Information	3
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$	3
Issue Information	3
Issue Information	3
Minimum Non‐Chromatic‐λ‐Choosable Graphs	3
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs	3
	3
Orientation‐based edge‐colorings and linear arboricity of multigraphs	3
On Endomorphism Universality of Sparse Graph Classes	3
On the number of edges of separated multigraphs	3

The number and average size of connected sets in graphs with degree constraints	3
Issue Information	3
	3
	3
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property	3
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes	3
Some results and problems on clique coverings of hypergraphs	3
New eigenvalue bound for the fractional chromatic number	3
Polynomial bounds for chromatic number. III. Excluding a double star	3
On the minimum number of arcs in 4‐dicritical oriented graphs	3
Constructing certain families of 3‐polytopal graphs	3
	3
Concentration of hitting times in Erdős‐Rényi graphs	3
Extremal Problems for a Matching and Any Other Graph	3
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles	3
Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’	2
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs	2
Spanning even trees of graphs	2
On the Minimum Degree of Minimally t‐Tough, Claw‐Free Graphs	2
On the number of star‐shaped classes in optimal colorings of Kneser graphs	2
Forbidden subgraphs and 2‐factors in 3/2‐tough graphs	2
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls	2
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers	2
Edge‐arc‐disjoint paths in semicomplete mixed graphs	2
Issue Information	2
Odd edge‐colorings of subdivisions of odd graphs	2
On Tight (k,ℓ)‐Stable Graphs	2
On Graphs With No Induced P5 or K5−e	2
Hamilton‐connected {claw, bull}‐free graphs	2
Uniformly 3‐connected graphs	2
Independent Sets of Random Trees and Sparse Random Graphs	2
Issue Information	2
	2
The maximum number of odd cycles in a planar graph	2
Turán‐ and Ramsey‐type results for unavoidable subgraphs	2
Issue Information	2
Inducibility in the hypercube	2
Pentavalent semisymmetric graphs of square‐free order	2
Elusive properties of infinite graphs	2
Issue Information	2
	2
Supereulerian Oriented Graphs With Large Arc‐Strong Connectivity	2
Interval colorings of graphs—Coordinated and unstable no‐wait schedules	2
Vertex‐disjoint cycles of the same length in tournaments	2
Issue Information	2
Bounds on Ramsey games via alterations	2
Non‐Hamiltonian Cycles in Tournaments	2
Eigenvalues and cycles of consecutive lengths	2
Forest formulas of discrete Green's functions	2
Polyhedra without cubic vertices are prism‐hamiltonian	2
Odd covers of graphs	2
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs	2
Issue Information	2
Subdivisions with congruence constraints in digraphs of large chromatic number	2
On the path partition number of 6‐regular graphs	2
Issue Information	2
Partitioning kite‐free planar graphs into two forests	2
The Average Solution of a TSP Instance in a Graph	2
Variants of the Gyárfás–Sumner conjecture: Oriented trees and rainbow paths	2
Self‐avoiding walks and polygons on hyperbolic graphs	2
Stability from graph symmetrization arguments in generalized Turán problems	2
Complete directed minors and chromatic number	2
Issue Information	2
	2
Bollobás‐Erdős‐Tuza Conjecture for Graphs With No Induced Ks,t	2
Dense circuit graphs and the planar Turán number of a cycle	2
The maximum number of maximum generalized 4‐independent sets in trees	2
Brooks‐Type Colourings of Digraphs in Linear Time	2
Ramsey numbers of the quadrilateral versus books	2
	2
Issue Information	2
Fractional factors and component factors in graphs with isolated toughness smaller than 1	2
A localized approach for Turán number of long cycles	2
On oriented m $m$‐semiregular representations of finite groups	2
Exact values for some unbalanced Zarankiewicz numbers	2
The distinguishing index of graphs with infinite minimum degree	1
Finding triangle‐free 2‐factors in general graphs	1
Strong arc decompositions of split digraphs	1
Turán number of the odd‐ballooning of complete bipartite graphs	1
Proof of a conjecture of Plummer and Zha	1

Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	1
Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles	1
On Seymour's and Sullivan's second neighbourhood conjectures	1
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs	1
Separating the Edges of a Graph by Cycles and by Subdivisions of K4	1
Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem	1
Oriented discrepancy of Hamilton cycles	1
Maximum spectral radius of outerplanar 3‐uniform hypergraphs	1
An extension of Nash‐Williams and Tutte's Theorem	1
Stability of Rose Window graphs	1
A variant of the Erdős–Rényi random graph process	1
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$	1
Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable	1
A decomposition method on solving the linear arboricity conjecture	1
Linear arboricity of degenerate graphs	1
Positive Co‐Degree Density of Hypergraphs	1
A Grid Theorem for Strong Immersions of Walls	1
Graphs with the unique path property: Structure, cycles, factors, and constructions	1
	1
Issue Information	1
Solution to a conjecture on the mean subtree order of graphs under edge addition	1
On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs	1
Issue Information	1
Simple versus nonsimple loops on random regular graphs	1
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected	1
Edge‐minimum saturated k‐planar drawings	1
Counting spanning trees in a complete bipartite graph which contain a given spanning forest	1
Large cycles in generalized Johnson graphs	1
Ramsey‐type problems on induced covers and induced partitions toward the Gyárfás–Sumner conjecture	1
Equitable oriented coloring	1
Spanning Plane Subgraphs of 1‐Plane Graphs	1
Defective acyclic colorings of planar graphs	1
A density bound for triangle‐free 4‐critical graphs	1
Subdigraphs of prescribed size and out‐degree	1
On the order of antipodal covers	1
Chromatic Polynomials of Signed Graphs and Dominating‐Vertex Deletion Formulae	1
A more accurate view of the Flat Wall Theorem	1
Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs	1
Hamilton‐connected {claw,net}‐free graphs, II	1
A Variant of the Teufl‐Wagner Formula and Applications	1
A complete description of convex sets associated with matchings and edge‐connectivity in graphs	1
Towards Nash‐Williams orientation conjecture for infinite graphs	1
	1
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph	1
Thin edges in cubic braces	1
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width	1
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	1
Rooted minors and locally spanning subgraphs	1
Berge's Conjecture for Cubic Graphs With Small Colouring Defect	1
	1
Switchover phenomenon for general graphs	1
	1
Uniformly connected graphs	1
	1
Corrigendum: The diameter of AT‐free graphs	1
Complete minors and average degree: A short proof	1
Correction to “Sharp threshold for embedding balanced spanning trees in random geometric graphs”	1
	1
The maximum number of paths of length three in a planar graph	1
A lower bound for the complex flow number of a graph: A geometric approach	1
Tight asymptotics of clique‐chromatic numbers of dense random graphs	1
Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups	1
Turán number for odd‐ballooning of trees	1
Double Vizing fans in critical class two graphs	1
Rainbow powers of a Hamilton cycle in Gn,p	1
Tree embeddings and tree‐star Ramsey numbers	1
All longest cycles in a 2‐connected partial 3‐tree share a common vertex	1
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids	1
Critical properties of bipartite permutation graphs	1
Eigenvalue Approach to Dense Clusters in Hypergraphs	1
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings	1
On construction for trees making the equality hold in Vizing's conjecture	1
Wheel‐Like Bricks and Minimal Matching Covered Graphs	1
Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs	1
Minimizing the Determinant of the Graph Laplacian	1
	1
Recognizing Trees From Incomplete Decks	1
Duality theorems for stars and combs IV: Undominating stars	1
Ramsey numbers upon vertex deletion	1
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result	1
Making a tournament k $k$‐strong	1
Dominating Kt‐Models	1
Ramsey numbers of trails and circuits	1
Issue Information	1
The maximum number of pentagons in a planar graph	1
Contractible edges in longest cycles	1
Structure of edges of embedded graphs with minimum degree two	1
A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs	1
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams	1
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials	1
The Alon–Tarsi number of planar graphs revisited	1
Cutting a tree with subgraph complementation is hard, except for some small trees	1
Independence number of edge‐chromatic critical graphs	1
Disjoint cycles in tournaments and bipartite tournaments	1
Graphs with girth 2ℓ+1 $2\ell +1$ and without longer odd holes are 3‐colorable	1