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 2020-03-01 to 2024-03-01.)

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
Strong edge colorings of graphs and the covers of Kneser graphs	6
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
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
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
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
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 list linear arboricity of graphs	3
On the mean subtree order of trees under edge contraction	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
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
Conflict‐free chromatic number versus conflict‐free chromatic index	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
Recognizing interval bigraphs by forbidden patterns	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
Degree sum conditions for the existence of homeomorphically irreducible spanning trees	2
Edge‐colored complete graphs without properly colored even cycles: A full characterization	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
Edge clique covers in graphs with independence number two	2
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs	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
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