OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Graph Theory is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)

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
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
C₁₀ Has Positive Turán Density in the Hypercube	7
On independent domination of regular graphs	7
Minimal bricks with the maximum number of edges	7

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
Gallai‐like characterization of strong cocomparability graphs	6
Supereulerian regular matroids without small cocircuits	6
	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
	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
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
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
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
New eigenvalue bound for the fractional chromatic number	3
On Endomorphism Universality of Sparse Graph Classes	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
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
On the number of edges of separated multigraphs	3
Issue Information	3
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$	3
Issue Information	3
Subdivisions with congruence constraints in digraphs of large chromatic number	2
Issue Information	2
Issue Information	2
On the path partition number of 6‐regular graphs	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
A localized approach for Turán number of long cycles	2
Fractional factors and component factors in graphs with isolated toughness smaller than 1	2
Exact values for some unbalanced Zarankiewicz numbers	2
On oriented m $m$‐semiregular representations of finite groups	2
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
The maximum number of odd cycles in a planar graph	2
	2
Issue Information	2
Turán‐ and Ramsey‐type results for unavoidable subgraphs	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
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs	2
Odd covers of graphs	2