Journal of Graph Theory

Article	Citations
Issue Information	31
	20
Erdös–Hajnal conjecture for new infinite families of tournaments	18
Counterexamples Regarding Linked and Lean Tree‐Decompositions of Infinite Graphs	15
Maximal Spectral Radius of Minimally k‐(Edge)‐Connected Graphs	15
Minimum degree stability of C2k+1 ${C}_{2k+1}$‐free graphs	14
The Generic Circular Triangle‐Free Graph	12
On the mean subtree order of trees under edge contraction	11
Decreasing the mean subtree order by adding k edges	11
Revisiting semistrong edge‐coloring of graphs	10
Maximum diameter of 3‐ and 4‐colorable graphs	10
Semistrong Edge Coloring and (0, 1)‐Relaxed Strong Edge Coloring of Graphs	10
Issue Information	10
Minimal bricks with the maximum number of edges	9
C10 Has Positive Turán Density in the Hypercube	9
Two disjoint cycles in digraphs	9
On Stahl's conjectures about the region distributions of bouquets	9
A Strong Structural Stability of C2k+1‐Free Graphs	8
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs	8
Distribution of Vertices Required a High‐Degree Condition on Partitions of Graphs Under Degree Constraints	8
On independent domination of regular graphs	7
A Stability Result for Almost Perfect Matchings	7
Gallai‐like characterization of strong cocomparability graphs	7
Making an H $H$‐free graph k $k$‐colorable	7
Erdős–Pósa property of obstructions to interval graphs	7

On Fork‐Free t‐Perfect Graphs	6
	6
On asymptotic packing of convex geometric and ordered graphs	6
	6
	6
Issue Information	6
Tight Minimum Degree Conditions for Apex‐Outerplanar Minors and Subdivisions in Graphs and Digraphs	6
	6
	6
Ubiquity of oriented rays	6
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
On coloring digraphs with forbidden induced subgraphs	5
DP color functions versus chromatic polynomials (II)	5
Rainbow structures in a collection of graphs with degree conditions	5
Extremal Results on Conflict‐Free Coloring	5
Short rainbow cycles for families of matchings and triangles	5
MaxCut in Graphs With Sparse Neighborhoods	5
Two Stability Theorems for Kℓ+1r‐Saturated Hypergraphs	5
Cliques in squares of graphs with maximum average degree less than 4	5
The Polynomial Method for Three‐Path Extendability of List Colourings of Planar Graphs	5
Removal of subgraphs and perfect matchings in graphs on surfaces	5
Spanning Weakly Even Trees of Graphs	5
Acyclic graphs with at least 2ℓ + 1 vertices are ℓ‐recognizable	4
Face‐simple minimal quadrangulations of surfaces	4
Clique‐width: Harnessing the power of atoms	4
On Strongly and Robustly Critical Graphs	4
On a Norine–Thomas conjecture concerning minimal bricks	4
Issue Information	4
On deeply critical oriented cliques	4
Counting triangles in regular graphs	4
Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree	4
On Tournament Inversion	4
The average degree of edge chromatic critical graphs with maximum degree seven	4
	4
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph	4
On λ $\lambda $‐backbone coloring of cliques with tree backbones in linear time	4
Ramsey numbers for multiple copies of sparse graphs	4
Long Induced Paths in Ks,s‐Free Graphs	4
Triangle‐free graphs with large chromatic number and no induced wheel	4
Signed Graphs, Nonorientable Surfaces, and Integer Flows	4
Concentration of hitting times in Erdős‐Rényi graphs	3
Issue Information	3
On the minimum number of arcs in 4‐dicritical oriented graphs	3
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes	3
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs	3
The Average Solution of a TSP Instance in a Graph	3
Some results and problems on clique coverings of hypergraphs	3
On Endomorphism Universality of Sparse Graph Classes	3
Issue Information	3
	3

Constructing certain families of 3‐polytopal graphs	3
New eigenvalue bound for the fractional chromatic number	3
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs	3
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls	3
On the Minimum Degree of Minimally t‐Tough, Claw‐Free Graphs	3
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$	3
Orientation‐based edge‐colorings and linear arboricity of multigraphs	3
Minimum Non‐Chromatic‐λ‐Choosable Graphs	3
On the number of edges of separated multigraphs	3
Issue Information	3
Issue Information	3
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles	3
R(5,5)≤46	3
Self‐avoiding walks and polygons on hyperbolic graphs	3
Issue Information	3
Ore‐Type Conditions for Existence of a Jellyfish in a Graph	3
	3
	3
Exact values for some unbalanced Zarankiewicz numbers	2
On Graphs With No Induced P5 or K5−e	2
Bounds on Ramsey games via alterations	2
B‐Coloring of Planar Graphs	2
Corrigendum to ‘flexible circuits in the d $d$‐dimensional rigidity matroid’	2
Fractional factors and component factors in graphs with isolated toughness smaller than 1	2
Bollobás‐Erdős‐Tuza Conjecture for Graphs With No Induced Ks,t	2
Tight Bounds for Hypercube Minor‐Universality	2
Elusive properties of infinite graphs	2
Forest formulas of discrete Green's functions	2
On oriented m $m$‐semiregular representations of finite groups	2
Issue Information	2
Halin's Grid Theorem for Digraphs	2
A localized approach for Turán number of long cycles	2
Subdivisions with congruence constraints in digraphs of large chromatic number	2
Issue Information	2
Brooks‐Type Colourings of Digraphs in Linear Time	2
Dense circuit graphs and the planar Turán number of a cycle	2
Stability from graph symmetrization arguments in generalized Turán problems	2
Vertex‐disjoint cycles of the same length in tournaments	2
Inducibility in the hypercube	2
Eigenvalues and cycles of consecutive lengths	2
Spanning even trees of graphs	2
	2
The maximum number of maximum generalized 4‐independent sets in trees	2
Supereulerian Oriented Graphs With Large Arc‐Strong Connectivity	2
Chromatic Ramsey Numbers and Two‐Color Turán Densities	2
Interval colorings of graphs—Coordinated and unstable no‐wait schedules	2
On the number of star‐shaped classes in optimal colorings of Kneser graphs	2
Sensitivity and Hamming Graphs	2
Variants of the Gyárfás–Sumner conjecture: Oriented trees and rainbow paths	2
	2
Extremal Problems for a Matching and Any Other Graph	2
Issue Information	2
Explicit 3‐colorings for Exponential Graphs	2
Turán Number of Books in Non‐Bipartite Graphs	2
Independent Sets of Random Trees and Sparse Random Graphs	2
Hamilton‐connected {claw, bull}‐free graphs	2
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids	2
Issue Information	2
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs	2
Matching Stability for 3‐Partite 3‐Uniform Hypergraphs	2
Edge‐Disjoint Spanning Trees, Eigenvalues, and Size of Graphs	2
Polyhedra without cubic vertices are prism‐hamiltonian	2
On Tight (k,ℓ)‐Stable Graphs	2
Ramsey numbers of the quadrilateral versus books	2
	2
Odd edge‐colorings of subdivisions of odd graphs	2
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers	2
Partitioning kite‐free planar graphs into two forests	2
Realizing Degree Sequences With S3‐Connected Graphs	2
	2
The maximum number of odd cycles in a planar graph	2
Odd covers of graphs	2
Uniformly 3‐connected graphs	2
Issue Information	2
Disjoint Total Dominating Sets in Planar Graphs	2
Non‐Hamiltonian Cycles in Tournaments	2
Issue Information	2
Forbidden subgraphs and 2‐factors in 3/2‐tough graphs	2
Edge‐arc‐disjoint paths in semicomplete mixed graphs	2
The Generalized Ramsey Number f(n,5,8)=67n+o(n)	2

On the Oriented Diameter of Graphs With Given Minimum Degree	2
Rooted minors and locally spanning subgraphs	1
Hamilton‐connected {claw,net}‐free graphs, II	1
The distinguishing index of graphs with infinite minimum degree	1
	1
Turán number for odd‐ballooning of trees	1
Weak Degeneracy of Planar Graphs	1
Large cycles in generalized Johnson graphs	1
	1
Recognizing Trees From Incomplete Decks	1
Turán number of the odd‐ballooning of complete bipartite graphs	1
Proof of a conjecture of Plummer and Zha	1
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams	1
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph	1
Line Graphs of Multigraphs and the Forbidden Graph E6	1
Correction to “Sharp threshold for embedding balanced spanning trees in random geometric graphs”	1
Positive Codegree Andrásfai–Erdős–Sós Theorem for the Generalized Triangle	1
	1
Critical properties of bipartite permutation graphs	1
A Grid Theorem for Strong Immersions of Walls	1
A lower bound for the complex flow number of a graph: A geometric approach	1
Issue Information	1
The Alon–Tarsi number of planar graphs revisited	1
Contractible edges in longest cycles	1
Graphs with girth 2ℓ+1 $2\ell +1$ and without longer odd holes are 3‐colorable	1
An extension of Nash‐Williams and Tutte's Theorem	1
Double Vizing fans in critical class two graphs	1
Thin edges in cubic braces	1
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	1
Spanning Plane Subgraphs of 1‐Plane Graphs	1
Towards Nash‐Williams orientation conjecture for infinite graphs	1
Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles	1
On Delta‐Wye Reducibility of Toroidal Graphs	1
On Minimal k‐Factor‐Critical Planar Graphs	1
Wheel‐Like Bricks and Minimal Matching Covered Graphs	1
Switchover phenomenon for general graphs	1
A more accurate view of the Flat Wall Theorem	1
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width	1
	1
Linear arboricity of degenerate graphs	1
Maximum Spread of Kr‐Minor Free Graphs	1
Positive Co‐Degree Density of Hypergraphs	1
Fractional List Packing for Layered Graphs	1
Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable	1
Tight asymptotics of clique‐chromatic numbers of dense random graphs	1
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected	1
A Characterization of Multigraphs Reaching Goldberg's Bound of Chromatic Index	1
	1
Defective acyclic colorings of planar graphs	1
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	1
Rainbow powers of a Hamilton cycle in Gn,p	1
Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs	1
Issue Information	1
Simple versus nonsimple loops on random regular graphs	1
On Seymour's and Sullivan's second neighbourhood conjectures	1
Issue Information	1
Corrigendum: The diameter of AT‐free graphs	1
Oriented discrepancy of Hamilton cycles	1
Disjoint cycles in tournaments and bipartite tournaments	1
Strong arc decompositions of split digraphs	1
Edge‐minimum saturated k‐planar drawings	1
Chromatic Polynomials of Signed Graphs and Dominating‐Vertex Deletion Formulae	1
Minimizing the Determinant of the Graph Laplacian	1
Making a tournament k $k$‐strong	1
On Oriented Colourings of Graphs on Surfaces	1
A density bound for triangle‐free 4‐critical graphs	1
Dominating Kt‐Models	1
	1
On a Clique‐Building Game of Erdős	1
Ramsey‐type problems on induced covers and induced partitions toward the Gyárfás–Sumner conjecture	1
Cutting a tree with subgraph complementation is hard, except for some small trees	1
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$	1
Subdigraphs of prescribed size and out‐degree	1
Counting Cliques Without Generalized Theta Graphs	1
Solution to a conjecture on the mean subtree order of graphs under edge addition	1
A Variant of the Teufl‐Wagner Formula and Applications	1
Semi‐Degree Condition for Arbitrary H‐Linked Oriented Graphs	1
Finding triangle‐free 2‐factors in general graphs	1
A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs	1
Issue Information	1
On the order of antipodal covers	1
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result	1
Domination in 4‐Regular Graphs With No Induced 4‐Cycles	1
Equitable oriented coloring	1
	1
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials	1
The maximum number of pentagons in a planar graph	1
Separating the Edges of a Graph by Cycles and by Subdivisions of K4	1
Graphs with the unique path property: Structure, cycles, factors, and constructions	1
Complete minors and average degree: A short proof	1
All longest cycles in a 2‐connected partial 3‐tree share a common vertex	1
Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem	1
Eigenvalue Approach to Dense Clusters in Hypergraphs	1
Stability of Rose Window graphs	1
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs	1