Journal of Graph Theory

Article	Citations
A complete solution to the Cvetković–Rowlinson conjecture	12
(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels	12
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs	11
High powers of Hamiltonian cycles in randomly augmented graphs	11
Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees	9
Eigenvalues and [a,b]‐factors in regular graphs	9
On graphs with no induced five‐vertex path or paraglider	9
Single‐conflict colouring	9
Duality theorems for stars and combs I: Arbitrary stars and combs	9
Unavoidable chromatic patterns in 2‐colorings of the complete graph	9
Turán numbers for disjoint paths	9
Polynomial bounds for chromatic number II: Excluding a star‐forest	8
The average size of a connected vertex set of a graph—Explicit formulas and open problems	8
An optimal χ‐bound for (P6, diamond)‐free graphs	8
Bounding the mim‐width of hereditary graph classes	8
Extremal graphs for odd wheels	8
Weak degeneracy of graphs	7
Polynomial bounds for chromatic number. III. Excluding a double star	7
On bisections of graphs without complete bipartite graphs	7
The maximum number of paths of length three in a planar graph	7
Counting paths, cycles, and blow‐ups in planar graphs	7
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs	7
Divisible subdivisions	7
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	6
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2	6

The Erdős–Gyárfás function with respect to Gallai‐colorings	6
On the mean subtree order of trees under edge contraction	6
Duality theorems for stars and combs II: Dominating stars and dominated combs	6
Flexible circuits in the d‐dimensional rigidity matroid	6
Exact bipartite Turán numbers of large even cycles	6
The diameter of AT‐free graphs	6
Strong edge colorings of graphs and the covers of Kneser graphs	6
Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors	6
Oriented diameter of maximal outerplanar graphs	6
Counting spanning trees in a complete bipartite graph which contain a given spanning forest	5
Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs	5
Decomposing planar graphs into graphs with degree restrictions	5
Mader's conjecture for graphs with small connectivity	5
Relating the independence number and the dissociation number	5
Between the enhanced power graph and the commuting graph	5
Towards Gallai's path decomposition conjecture	5
Triangles in C5‐free graphs and hypergraphs of girth six	5
Recognizing interval bigraphs by forbidden patterns	5
Gallai–Ramsey number for K5 ${K}_{5}$	5
A bound on the dissociation number	5
Directed Steiner tree packing and directed tree connectivity	4
Antimagic orientation of graphs with minimum degree at least 33	4
The number and average size of connected sets in graphs with degree constraints	4
Matchings in 1‐planar graphs with large minimum degree	4
On coloring digraphs with forbidden induced subgraphs	4
On the maximum number of odd cycles in graphs without smaller odd cycles	4
Face distributions of embeddings of complete graphs	4
Induced subgraphs of product graphs and a generalization of Huang's theorem	4
Hamilton‐connected {claw, net}‐free graphs, I	4
On the number of edges in maximally linkless graphs	4
Ramsey numbers of large books	4
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth	4
Proof of a conjecture of Plummer and Zha	4
Extremal total distance of graphs of given radius I	4
Domination in digraphs and their direct and Cartesian products	4
Duality theorems for stars and combs III: Undominated combs	4
Graphs of low average degree without independent transversals	3
An (F1,F4)‐partition of graphs with low genus and girth at least 6	3
A note on uniquely 10‐colorable graphs	3
Multiplicity of  the second‐largest eigenvalue of a planar graph	3
Reconfiguration of connected graph partitions	3
Spanning eulerian subdigraphs in semicomplete digraphs	3
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs	3
Asymptotically good edge correspondence colourings	3
Forest formulas of discrete Green's functions	3
Orientation‐based edge‐colorings and linear arboricity of multigraphs	3
Linear arboricity of degenerate graphs	3
Quartic graphs with minimum spectral gap	3
Conflict‐free chromatic number versus conflict‐free chromatic index	3
Shifting paths to avoidable ones	3

Eigenvalues and cycles of consecutive lengths	3
Edge colorings and circular flows on regular graphs	3
On independent domination of regular graphs	3
Between proper and strong edge‐colorings of subcubic graphs	3
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration	3
A limit theorem for small cliques in inhomogeneous random graphs	3
Curvature on graphs via equilibrium measures	3
DP‐coloring Cartesian products of graphs	3
Forbidden pairs of disconnected graphs for 2‐factor of connected graphs	3
The product structure of squaregraphs	3
A note on Goldberg's conjecture on total chromatic numbers	3
Partitioning digraphs with outdegree at least 4	3
The list linear arboricity of graphs	3
Erdös–Hajnal conjecture for new infinite families of tournaments	3
Highly edge‐connected regular graphs without large factorizable subgraphs	3
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest	3
Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs	2
Edge clique covers in graphs with independence number two	2
Flexible list colorings in graphs with special degeneracy conditions	2
Rainbow structures in a collection of graphs with degree conditions	2
Balanced supersaturation for some degenerate hypergraphs	2
Perfect matchings in random subgraphs of regular bipartite graphs	2
Distinguishing threshold of graphs	2
On the probability that a random subtree is spanning	2
Graph colorings with restricted bicolored subgraphs: II. The graph coloring game	2
Isoradial immersions	2
Light edges in 1‐planar graphs	2
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result	2
Colorings of complements of line graphs	2
Oriented discrepancy of Hamilton cycles	2
Graphs with no induced house nor induced hole have the de Bruijn–Erdös property	2
Counting hypergraphs with large girth	2
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$	2
Turán number for odd‐ballooning of trees	2
Edge‐colored complete graphs without properly colored even cycles: A full characterization	2
Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator	2
Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs	2
Edge coloring graphs with large minimum degree	2
Chromatic number is Ramsey distinguishing	2
Hamilton‐connected {claw, bull}‐free graphs	2
Lower bounds on the Erdős–Gyárfás problem via color energy graphs	2
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs	2
Triangle‐free equimatchable graphs	2
Transversals of longest cycles in partial k‐trees and chordal graphs	2
The Hamiltonicity of essentially 9‐connected line graphs	2
Hamiltonicity of graphs perturbed by a random geometric graph	2
Symmetries of the honeycomb toroidal graphs	2
Edge‐maximal graphs on orientable and some nonorientable surfaces	2
Kempe equivalence of 4‐critical planar graphs	2
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties	2
On the extremal function for graph minors	2
Occupancy fraction, fractional colouring, and triangle fraction	2
Degree sum conditions for the existence of homeomorphically irreducible spanning trees	2
Minimum degree and the graph removal lemma	2
Duality theorems for stars and combs IV: Undominating stars	2
Ramsey numbers of trails and circuits	2
Subdivisions with congruence constraints in digraphs of large chromatic number	2
Sparse halves in K4‐free graphs	2
An induced subgraph of the Hamming graph with maximum degree 1	2
On 3‐polytopes with non‐Hamiltonian prisms	2
Making an H $H$‐free graph k $k$‐colorable	2
Induced path factors of regular graphs	2
Circular coloring and fractional coloring in planar graphs	2
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result	2
On the edge‐biclique graph and the iterated edge‐biclique operator	2
Multithreshold multipartite graphs	2
A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space	2
Ubiquity of graphs with nowhere‐linear end structure	2
Find subtrees of specified weight and cycles of specified length in linear time	2
Greedoids from flames	1
Disjoint cycles in tournaments and bipartite tournaments	1
Polyhedra without cubic vertices are prism‐hamiltonian	1
On construction for trees making the equality hold in Vizing's conjecture	1
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$	1
Disjoint total dominating sets in near‐triangulations	1
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs	1
Bounds on Ramsey games via alterations	1
Independent set and matching permutations	1
On supersaturation and stability for generalized Turán problems	1
On a generalized Erdős–Rademacher problem	1

Algebraic connectivity of the second power of a graph	1
Heroes in oriented complete multipartite graphs	1
Odd covers of graphs	1
The giant component after percolation of product graphs	1
Hamilton‐connected {claw,net}‐free graphs, II	1
On the path partition number of 6‐regular graphs	1
Domination versus independent domination in regular graphs	1
Wreath product in automorphism groups of graphs	1
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs	1
A subquadratic algorithm for the simultaneous conjugacy problem	1
The strong clique index of a graph with forbidden cycles	1
Pentavalent semisymmetric graphs of square‐free order	1
Supereulerian regular matroids without small cocircuits	1
Finding a shortest even hole in polynomial time	1
Partitioning kite‐free planar graphs into two forests	1
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems	1
Strongly perfect claw‐free graphs—A short proof	1
A tight bound for independent domination of cubic graphs without 4‐cycles	1
The connectivity of the dual	1
Bounding the number of odd paths in planar graphs via convex optimization	1
A variant of the Erdős–Rényi random graph process	1
Seurat games on Stockmeyer graphs	1
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring	1
Perfect matchings and derangements on graphs	1
Bisimplicial separators	1
Some conditions implying stability of graphs	1
Good acyclic orientations of 4‐regular 4‐connected graphs	1
The strong fractional choice number of 3‐choice‐critical graphs	1
Removal of subgraphs and perfect matchings in graphs on surfaces	1
Local orthogonality dimension	1
Rainbow connectivity of randomly perturbed graphs	1
Extremal spectral results of planar graphs without vertex‐disjoint cycles	1
Adaptable and conflict colouring multigraphs with no cycles of length three or four	1
Universal graphs for the topological minor relation	1
Distinguishing infinite graphs with bounded degrees	1
About the number of oriented Hamiltonian paths and cycles in tournaments	1
Girth and λ $\lambda $‐choosability of graphs	1
Improved bounds for the oriented radius of mixed multigraphs	1
On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs	1
On weighted sublinear separators	1
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs	1
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes	1
Induced subgraphs and tree decompositions V. one neighbor in a hole	1
Andrásfai and Vega graphs in Ramsey–Turán theory	1
Turán‐ and Ramsey‐type results for unavoidable subgraphs	1
Interval colorings of graphs—Coordinated and unstable no‐wait schedules	1
Decomposing subcubic graphs into claws, paths or triangles	1
The (t−1) $(t-1)$‐chromatic Ramsey number for paths	1
Exact values for some unbalanced Zarankiewicz numbers	1
On multichromatic numbers of widely colorable graphs	1
Enumerative problems for arborescences and monotone paths on polytope graphs	1
Packing of spanning mixed arborescences	1
The maximum number of induced C5's in a planar graph	1
Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings	1
Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection	1
A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs	1
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable	1
Uniformly connected graphs	1
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs	1
Longest cycles in 3‐connected hypergraphs and bipartite graphs	1
New eigenvalue bound for the fractional chromatic number	1
Ramsey numbers of the quadrilateral versus books	1
Planar Legendrian Θ ${\rm{\Theta }}$‐graphs	1
Signed analogue of line graphs and their smallest eigenvalues	1
Connected search for a lazy robber	1
Distinguishing orthogonality graphs	1
The symmetry property of (n,k)‐arrangement graph	1
Minimal bricks with the maximum number of edges	1
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls	1
Triangle‐free graphs with large chromatic number and no induced wheel	1
Making a tournament k $k$‐strong	1
The mod k $k$ chromatic index of graphs is O(k) $O(k)$	1
A more accurate view of the Flat Wall Theorem	1
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs	1
Induced odd cycle packing number, independent sets, and chromatic number	1
DP color functions versus chromatic polynomials (II)	1
Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree	1
Large monochromatic components in hypergraphs with large minimum codegree	1
Complete directed minors and chromatic number	1
On the quartet distance given partial information	1
Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs	1
Kings in multipartite hypertournaments	1
Rainbow powers of a Hamilton cycle in Gn,p	1
Strong chromatic index and Hadwiger number	1