Journal of Graph Theory

Article	Citations
A survey of χ‐boundedness	64
Coloring graphs with no induced five‐vertex path or gem	15
The maximum number of maximum dissociation sets in trees	12
High powers of Hamiltonian cycles in randomly augmented graphs	10
A complete solution to the Cvetković–Rowlinson conjecture	9
Arc‐disjoint strong spanning subdigraphs of semicomplete compositions	9
Duality theorems for stars and combs I: Arbitrary stars and combs	9
On the mean subtree order of graphs under edge addition	9
On graphs with no induced five‐vertex path or paraglider	9
Bounding the mim‐width of hereditary graph classes	8
Single‐conflict colouring	8
Proper orientation number of triangle‐free bridgeless outerplanar graphs	8
An optimal χ‐bound for (P6, diamond)‐free graphs	7
Proof of a conjecture on the nullity of a graph	7
Polynomial bounds for chromatic number II: Excluding a star‐forest	7
The average size of a connected vertex set of a graph—Explicit formulas and open problems	7
Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees	7
Duality theorems for stars and combs II: Dominating stars and dominated combs	6
Extremal graphs for odd wheels	6
(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels	6
Unavoidable chromatic patterns in 2‐colorings of the complete graph	6
Strong edge colorings of graphs and the covers of Kneser graphs	6
Polynomial bounds for chromatic number. III. Excluding a double star	5
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs	5
On the maximum number of maximum independent sets in connected graphs	5

Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs	5
Divisible subdivisions	5
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs	5
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2	5
Turán numbers for disjoint paths	5
Oriented diameter of maximal outerplanar graphs	5
Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs	5
Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors	5
Flexible circuits in the d‐dimensional rigidity matroid	5
On bisections of graphs without complete bipartite graphs	5
Triangles in C5‐free graphs and hypergraphs of girth six	5
Partitions of hypergraphs under variable degeneracy constraints	4
Matchings in 1‐planar graphs with large minimum degree	4
Ramsey numbers of large books	4
Curvatures, graph products and Ricci flatness	4
Proper‐walk connection number of graphs	4
Flexibility of planar graphs of girth at least six	4
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	4
Between the enhanced power graph and the commuting graph	4
Gallai–Ramsey number for K5 ${K}_{5}$	4
Duality theorems for stars and combs III: Undominated combs	4
The Erdős–Gyárfás function with respect to Gallai‐colorings	4
On the maximum number of copies of H in graphs with given size and order	4
The diameter of AT‐free graphs	4
Short rainbow cycles in graphs and matroids	4
Lines in bipartite graphs and in 2‐metric spaces	4
Decomposing planar graphs into graphs with degree restrictions	4
Counting paths, cycles, and blow‐ups in planar graphs	4
Eigenvalues and [a,b]‐factors in regular graphs	4
Flexibility of triangle‐free planar graphs	4
Edge proximity and matching extension in projective planar graphs	4
The maximum number of paths of length three in a planar graph	4
On the inclusion chromatic index of a graph	4
A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number	4
A note on uniquely 10‐colorable graphs	3
On the number of edges in maximally linkless graphs	3
Partitioning digraphs with outdegree at least 4	3
Weak degeneracy of graphs	3
Antimagic orientation of graphs with minimum degree at least 33	3
Face distributions of embeddings of complete graphs	3
Asymptotically good edge correspondence colourings	3
Forest formulas of discrete Green's functions	3
Linear arboricity of degenerate graphs	3
Coloring rings	3
Forbidden pairs of disconnected graphs for 2‐factor of connected graphs	3
Shifting paths to avoidable ones	3
Edge colorings and circular flows on regular graphs	3
Mader's conjecture for graphs with small connectivity	3
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments	3
Erdös–Hajnal conjecture for new infinite families of tournaments	3

Conflict‐free chromatic number versus conflict‐free chromatic index	3
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration	3
Orientation‐based edge‐colorings and linear arboricity of multigraphs	3
Hamilton‐connected {claw, net}‐free graphs, I	3
Domination in digraphs and their direct and Cartesian products	3
On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups	3
The chromatic number of {ISK4, diamond, bowtie}‐free graphs	3
On coloring digraphs with forbidden induced subgraphs	3
Between proper and strong edge‐colorings of subcubic graphs	3
The list linear arboricity of graphs	3
On the mean subtree order of trees under edge contraction	3
Recognizing interval bigraphs by forbidden patterns	3
Highly edge‐connected regular graphs without large factorizable subgraphs	3
A limit theorem for small cliques in inhomogeneous random graphs	3
Graphs of low average degree without independent transversals	3
Extremal total distance of graphs of given radius I	2
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs	2
Graph colorings with restricted bicolored subgraphs: II. The graph coloring game	2
List Ramsey numbers	2
A unified approach to construct snarks with circular flow number 5	2
Isoradial immersions	2
Edge‐maximal graphs on orientable and some nonorientable surfaces	2
Circular coloring and fractional coloring in planar graphs	2
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties	2
On the extremal function for graph minors	2
Minimum degree and the graph removal lemma	2
A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space	2
Edge‐colored complete graphs without properly colored even cycles: A full characterization	2
Degree sum conditions for the existence of homeomorphically irreducible spanning trees	2
Eigenvalues and cycles of consecutive lengths	2
Balanced supersaturation for some degenerate hypergraphs	2
Towards Gallai's path decomposition conjecture	2
On the probability that a random subtree is spanning	2
Directed Steiner tree packing and directed tree connectivity	2
Triangle‐free equimatchable graphs	2
Distinguishing threshold of graphs	2
Induced subgraphs of product graphs and a generalization of Huang's theorem	2
Order plus size of τ‐critical graphs	2
Colorings of complements of line graphs	2
On independent domination of regular graphs	2
Light edges in 1‐planar graphs	2
Exact bipartite Turán numbers of large even cycles	2
The number and average size of connected sets in graphs with degree constraints	2
Proof of a conjecture of Plummer and Zha	2
Graph‐like compacta: Characterizations and Eulerian loops	2
Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator	2
Duality theorems for stars and combs IV: Undominating stars	2
A note on Goldberg's conjecture on total chromatic numbers	2
Multiplicity of  the second‐largest eigenvalue of a planar graph	2
On 3‐polytopes with non‐Hamiltonian prisms	2
Spanning eulerian subdigraphs in semicomplete digraphs	2
On induced subgraphs of the Hamming graph	2
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	2
Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane	2
Sparse halves in K4‐free graphs	2
An (F1,F4)‐partition of graphs with low genus and girth at least 6	2
Clique‐convergence is undecidable for automatic graphs	2
Hamiltonicity of graphs perturbed by a random geometric graph	2
The Hamiltonicity of essentially 9‐connected line graphs	2
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property	2
Counting hypergraphs with large girth	2
Occupancy fraction, fractional colouring, and triangle fraction	2
On the edge‐biclique graph and the iterated edge‐biclique operator	2
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs	2
Edge clique covers in graphs with independence number two	2
Reconfiguration of connected graph partitions	2
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth	2
Ramsey numbers of trails and circuits	2
Size reconstructibility of graphs	2
On the maximum number of odd cycles in graphs without smaller odd cycles	2
Chromatic number is Ramsey distinguishing	1
Hamilton‐connected {claw,net}‐free graphs, II	1
Ubiquity of graphs with nowhere‐linear end structure	1
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs	1
DP‐coloring Cartesian products of graphs	1
Curvature on graphs via equilibrium measures	1
Andrásfai and Vega graphs in Ramsey–Turán theory	1
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes	1
The giant component after percolation of product graphs	1
Multiple list coloring of 3‐choice critical graphs	1

On nonfeasible edge sets in matching‐covered graphs	1
Good acyclic orientations of 4‐regular 4‐connected graphs	1
On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs	1
Quartic graphs with minimum spectral gap	1
Turán number for odd‐ballooning of trees	1
Induced odd cycle packing number, independent sets, and chromatic number	1
Flexible list colorings in graphs with special degeneracy conditions	1
Packing of spanning mixed arborescences	1
Turán‐ and Ramsey‐type results for unavoidable subgraphs	1
Enumerative problems for arborescences and monotone paths on polytope graphs	1
Greedoids from flames	1
A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs	1
Distinguishing infinite graphs with bounded degrees	1
Planar Legendrian Θ ${\rm{\Theta }}$‐graphs	1
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result	1
k‐quasi‐transitive digraphs of large diameter	1
Fractional chromatic number of a random subgraph	1
Edge coloring graphs with large minimum degree	1
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result	1
On supersaturation and stability for generalized Turán problems	1
Ramsey numbers of the quadrilateral versus books	1
Making a tournament k $k$‐strong	1
Multithreshold multipartite graphs	1
Hamilton‐connected {claw, bull}‐free graphs	1
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls	1
Graphs of bounded depth‐2 rank‐brittleness	1
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs	1
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs	1
The symmetry property of (n,k)‐arrangement graph	1
Making an H $H$‐free graph k $k$‐colorable	1
Transversals of longest cycles in partial k‐trees and chordal graphs	1
Girth and λ $\lambda $‐choosability of graphs	1
Edge precoloring extension of hypercubes	1
Triangle‐free graphs with large chromatic number and no induced wheel	1
Oriented discrepancy of Hamilton cycles	1
The mod k $k$ chromatic index of graphs is O(k) $O(k)$	1
Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs	1
Local orthogonality dimension	1
Counting spanning trees in a complete bipartite graph which contain a given spanning forest	1
The product structure of squaregraphs	1
On a generalized Erdős–Rademacher problem	1
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$	1
Strong chromatic index and Hadwiger number	1
Connected search for a lazy robber	1
New eigenvalue bound for the fractional chromatic number	1
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture	1
On construction for trees making the equality hold in Vizing's conjecture	1
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings	1
Symmetries of the honeycomb toroidal graphs	1
Edge‐decomposing graphs into coprime forests	1
Bounds on Ramsey games via alterations	1
Uniformly connected graphs	1
Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree	1
A bound on the dissociation number	1
Finding any given 2‐factor in sparse pseudorandom graphs efficiently	1
Wreath product in automorphism groups of graphs	1
On the path partition number of 6‐regular graphs	1
The strong fractional choice number of 3‐choice‐critical graphs	1
The strong clique index of a graph with forbidden cycles	1
Rainbow connectivity of randomly perturbed graphs	1
Group connectivity under 3‐edge‐connectivity	1
Good orientations of unions of edge‐disjoint spanning trees	1
Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs	1
Perfect matchings in random subgraphs of regular bipartite graphs	1
Finding a shortest even hole in polynomial time	1
Domination versus independent domination in regular graphs	1
Seurat games on Stockmeyer graphs	1
On multichromatic numbers of widely colorable graphs	1
On weighted sublinear separators	1
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection	1
Pentavalent semisymmetric graphs of square‐free order	1
Perfect matchings and derangements on graphs	1
	1
Universal graphs for the topological minor relation	1
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs	1
Find subtrees of specified weight and cycles of specified length in linear time	1
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$	1
Arc‐transitive maps with underlying Rose Window graphs	1
Independent set and matching permutations	1
Zip product of graphs and crossing numbers	1
Adaptable and conflict colouring multigraphs with no cycles of length three or four	1
Induced path factors of regular graphs	1
Disjoint total dominating sets in near‐triangulations	1
Generating simple near‐bipartite bricks	1
Signed analogue of line graphs and their smallest eigenvalues	1
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles	0
Issue Information	0
Classifying intrinsically linked tournaments by score sequence	0
Equitable oriented coloring	0
Issue Information	0
Even A‐cycles have the edge‐Erdős–Pósa property	0
	0
In Memoriam	0
Signed colouring and list colouring of k‐chromatic graphs	0
Longest cycles in 3‐connected hypergraphs and bipartite graphs	0