Graphs and Combinatorics

Papers
(The TQCC of Graphs and Combinatorics is 1. 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-05-01 to 2026-05-01.)
ArticleCitations
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent $$4^-$$-Cycles18
Erdős–Gyárfás conjecture for $$P_8$$-free graphs12
The Eulerian Distribution on the Fixed-Point Free Involutions of the Hyperoctahedral Group Under the Natural Order11
Existential Closure in Line Graphs10
Neighborhood Complexes, Homotopy Test Graphs and an Application to Coloring of Product Graphs9
Disjoint Edges in Geometric Graphs9
Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree9
A Conjecture on Different Central Parts of Binary Trees9
The Existence of a Path with Two Blocks in Digraphs8
Super Graphs on Groups, I8
Higher-dimensional counterexamples to Hamiltonicity7
Injective Split Systems7
Hamiltonian Paths and Cycles in Some 4-Uniform Hypergraphs7
Odd-Even Factors of Graphs7
Results and Problems on Chorded Cycles: A Survey7
Odd Induced Subgraphs in Planar Graphs with Large Girth7
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs7
The Sandpile Group of Polygon Rings and Twisted Polygon Rings7
Coloring Graphs in Oriented Coloring of Cubic Graphs6
On Some Subclasses of Oriented Catch Digraphs6
Perfect One-Factorizations Arising from the Lee Metric6
On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs6
A generalization of a theorem of Nash-Williams6
Injective Edge-Coloring of Graphs with Small Weight6
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles5
Improved Lower Bounds on the Extrema of Eigenvalues of Graphs5
2-Reducible Two Paths and Two Edges Constructing a Cycle in $$(2k+1)$$-Edge-Connected Graphs5
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven5
An equitable partition for the distance-regular graph of the bilinear forms5
The Cordiality Game and the Game Cordiality Number5
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs5
Double Coalitions in Regular Graphs5
Intersection Graphs of Maximal Sub-polygons of k-Lizards5
$$K_{1,2,2,2}$$ has no n-fold planar cover for $$n<14$$5
On Rainbow Quadrilaterals in Colored Point Sets5
Isolation Game on Graphs5
Kissing Numbers for Balls with Varying Radii4
On Non-degenerate Berge–Turán Problems4
The Eulerian Distribution on k-Colored Involutions4
Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs4
On Well-Edge-Dominated Graphs4
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments4
Tighter Bounds on Directed Ramsey Number R(7)4
Ramsey Numbers and Graph Parameters4
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth4
Minimally k-Factor-Critical Graphs for Some Large k4
New Results on k-independence of Hypergraphs4
Semi-strict Chordality of Digraphs4
Canonical Binary $$\Delta $$-Matroids4
New Tools to Study 1-11-Representation of Graphs3
On Generalized Turán Number of Two Disjoint Cliques3
Maxima of the Q-Spectral Radius of $$C_3$$ ($$C_4$$)-Free Graphs with Given Size and Minimum Degree $$\delta \ge 2$$3
On the Size of $$(K_t, P_k)$$-Co-Critical Graphs3
Graphs with Positive Ricci Curvature3
Connected Matchings in Graphs with Independence Number Two3
Dimension of Restricted Classes of Interval Orders3
Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups3
Homotopy and Hom Construction in the Category of Finite Hypergraphs3
A Classification of Hyperfocused 12-Arcs3
On Generalized Turán Numbers of Intersecting Cliques3
Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs3
Constructions of Sarvate-Beam Group Divisible Designs3
Proof of a conjecture of Xiao and Zamora3
Partition and Disjoint Cycles in Digraphs3
A Note on Sullivan’s Second Neighborhood Conjecture3
Perfect Pseudo-Matchings in Cubic Graphs3
The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs3
Closed Neighborhood Balanced Coloring of Graphs3
A Note on Coloring $$(4K_1, C_4, C_6)$$-Free Graphs with a $$C_7$$3
Injectively $$k$$-Colored Rooted Forests3
Path Saturation Game on Six Vertices3
Visibility in Hypercubes3
On the Equitable Choosability of the Disjoint Union of Stars3
Extremal Graphs for Widom–Rowlinson Colorings in k-Chromatic Graphs3
Weak-Dynamic Coloring of Graphs Beyond-Planarity2
Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest2
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding2
Claw-Free Solid Bricks2
The $$p-$$Arboricity of Outerplanar Graphs2
Exact Decompositions and Zero-Divisor Graphs2
Borodin–Kostochka Conjecture Holds for Odd-Hole-Free Graphs2
On Independent Domination in Direct Products2
Injective Hulls of Various Graph Classes2
Panconnectivity in Bipartite Graphs with Large Degree sum2
On the 3-Color Ramsey Numbers $$R(C_4,C_4,W_{n})$$2
Ramsey Numbers of Multiple Copies of Graphs in a Component2
Conflict-Free Connection Number of Graphs with Four Bridges2
On Flipping Edge Sets in Unique Sink Orientations2
A Note on the Turán Number of an Arbitrary Star Forest2
Flip colouring of graphs2
Thin Q-Polynomial Distance-Regular Graphs Have Bounded $$c_2$$2
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 22
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number2
Euclidean 2-Designs as Stationary Points of Many-Body Systems2
Correction to: Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q2
Correction to: Every Cubic Bipartite Graph has a Prime Labeling Except $$K_{3,3}$$2
Hamiltonian Cycles and Tight Cutsets2
Word-Representation of Melon Graphs2
A Classification of Disconnected Graphs with Exactly One Cycle by Their Dot Product Dimension2
A Simple Proof of Ore’s Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter2
Topological Inductive Constructions for Tight Surface Graphs2
H-Kernels by Walks2
On the Spectra of Simplicial Rook Graphs2
The Explorer–Director Game on Graphs2
Regular Hypermaps with the Automorphism Group $$\hbox {PSL}(3,p)$$2
The Number of Copies of $$K_{2,t+1}$$ in a Graph2
Infinite Ramsey-Minimal Graphs for Star Forests2
Star-Critical Ramsey Numbers Involving Large Generalized Fans2
Note on Polychromatic Coloring of Hereditary Hypergraph Families2
The Bounds of Rigid Sphere Design2
On the structure of some classes of $$(P_{2}\cup P_{3})$$-free graphs2
Multipermutations and Stirling Multipermutations2
Prime Sum Graphs and the Induced Trees They Contain2
Correction to: The uvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations2
A Q-Polynomial Structure Associated with the Projective Geometry $$L_N(q)$$2
Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry2
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth2
Odd coloring of signed graphs2
Isolation of Connected Graphs in Terms of Size2
Some Statistics on Generalized Motzkin Paths with Vertical Steps2
Correction: A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs2
Partition Lattice with Limited Block Sizes2
Characterization of $$P_3\cup P_2$$-Equipackable Graphs with $$3m (m\ge 1)$$ Edges2
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric2
Frames and Doubly Resolvable Group Divisible Designs with Block Size Three and Index Two2
Emanation Graph: A Plane Geometric Spanner with Steiner Points2
Ramsey Numbers for Multiple Copies of Hypergraphs2
Dichromatic number of chordal graphs2
Integer Sequences Generated by the Determinants of Matrices Associated with Threshold Graphs2
An Anti-Ramsey Theorem of k-Restricted Edge-Cuts2
Spanning Trees with Few Branch Vertices in a Chair-Free Graph2
A Construction of Optimal 1-Spontaneous Emission Error Designs1
Upper Bounds for the List-Distinguishing Chromatic Number1
A Deletion–Contraction Relation for the DP Color Function1
Regular generalized cayley maps of elementary abelian p-groups1
Automorphism Groups of 2-Token Graph of Cartesian Product of Two Cycles1
A Note on Internal Partitions: The 5-Regular Case and Beyond1
On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours1
Strong Arboricity of Graphs1
Maximum Rectilinear Crossing Number of Uniform Hypergraphs1
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree1
Toroidal Cartesian Products Where One Factor is 3-Connected1
A Note on Additive Bases of Abelian Groups of Rank 21
Almost Intersecting Families for Vector Spaces1
Stability of Generalized Turán Number for Linear Forests1
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph1
On the Number of Drawings of a Combinatorial Triangulation1
On the Linear Arboricity of Graphs with Treewidth at Most Four1
Hamilton Paths in Dominating Graphs of Trees and Cycles1
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs1
Strongly Regular Graphs from Pseudocyclic Association Schemes1
Injective Edge-Colorings of $$K_4$$-Minor Free Graphs1
The Generalized Motzkin Family1
Fashion Game on Planar Graphs1
A Matrix for Counting Paths in Acyclic Colored Digraphs1
The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$1
When a Decomposable Tournament is $$\{-1,3\}$$-Reconstructible?1
Block-Transitive 3-Designs with Block Size At Most 61
The burning number conjecture holds for trees of order n with at most $$\left\lfloor \sqrt{n-1}\right\rfloor $$ degree-2 vertices1
Ternary Extremal Four-Negacirculant Self-Dual Codes1
Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs1
A Spectral Condition for the Existence of the Square of a Path1
Fusions of the generalized Hamming scheme on a strongly-regular graph1
Set Systems with Covering Properties and Low VC-Dimension1
On Intersection Graphs of Spherical Caps1
The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others1
On a List Variant of the Multiplicative 1-2-3 Conjecture1
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs1
On Restricted Intersections and the Sunflower Problem1
A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs1
Projective dimension and regularity of 3-path ideals of unicyclic graphs1
All generalized rose window graphs are hamiltonian1
Structure and Coloring of a Family of ($$P_7, C_5$$)-Free Graphs1
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number1
Partitioning Edge-Colored Graphs with Constrained Color Degrees1
Characterization of (m, n)-Linked Planar Graphs1
Intersection Numbers of Certain 2-Designs from Finite Fields1
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number1
Graph Profiles as Characters on Bicommutative Hopf Algebras1
Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees1
On the Fixing Sets of Finite Groups1
Contractible Edges in Spanning Trees of 3-Connected Graphs1
Four-vertex traces of finite sets1
Neighbor sum distinguishing index of $$K_4$$-minor free graphs1
Loose Edge-Connection of Graphs1
On Strict Brambles1
Mutually Orthogonal Sudoku Latin Squares and Their Graphs1
Injective Chromatic Index of $$K_4$$-Minor Free Graphs1
Some More Updates on an Annihilation Number Conjecture: Pros and Cons1
Integral and rational graphs in the plane1
Reconstruction of a Coloring from its Homogeneous Sets1
On Extremal Problems on Multigraphs1
On Tutte Cycles Containing Three Prescribed Edges1
Total Coalitions in Claw-Free Cubic Graphs Containing Double-Bonded Triangle-Units1
Veto Interval Graphs and Variations1
On New Record Graphs Close to Bipartite Moore Graphs1
Dynamic Cycles in Edge-Colored Multigraphs1
Coefficients of the Matching Polynomial of a Self-Complementary Graph1
Upper-embeddability and the decycling number of connected 4-regular graphs1
Optimal Chromatic Bound for ($$P_3\cup P_2$$, House)-Free Graphs1
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property1
Algorithmic and structural results of directed Steiner path packing and directed path connectivity1
On the Unimodality of Domination Polynomials1
2-Nested Matrices: Towards Understanding the Structure of Circle Graphs1
An Upper Bound for the 3-Tone Chromatic Number of Graphs with Maximum Degree 31
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters1
Towards Optimal $$\chi $$-Binding Functions of ($$2K_1 \cup K_2$$)-Free Graphs and ($$P_3 \cup K_1$$)-Free Graphs1
Diameter Three Orientability of Mixed Bipartite Graphs1
Extensions of Moon’s and Bagga and Beineke’s theorems on dicycle and score (outdegree) structures of tournaments1
Generalized Turán Problems for Complete Bipartite Graphs1
A note on vertex Turán problems in the Kneser cube1
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs1
Complexity of Near-3-Choosability Problem1
Edge-Disjoint Steiner Trees and Connectors in Graphs1
Ramsey Numbers for Complete Graphs Versus Generalized Fans1
Rainbow Hamiltonicity with large edge numbers1
New Counterexamples to a Conjecture by Woodall on Graph Minors and List Coloring1
An Exponential Bound for Simultaneous Embeddings of Planar Graphs1
Weighted Tutte–Grothendieck Polynomials of Graphs1
Correction: Callan permutations and odd order permutations1
The Generalized Terwilliger Algebra of the Hypercube1
Between Weak and Bruhat: The Middle Order on Permutations1
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture1
Ortho-Unit Polygons can be Guarded with at most $$\left\lfloor \frac{n-4}{8} \right\rfloor $$ Guards1
A New Connectivity Bound for a Tournament to be Highly Linked1
Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments1
Region Crossing Change on Plane Trivalent Graphs1
The Odd Chromatic Number of a Planar Graph is at Most 81
0.20793390274048