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 2021-07-01 to 2025-07-01.)
ArticleCitations
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs13
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent $$4^-$$-Cycles12
Injective Split Systems12
Erdős–Gyárfás conjecture for $$P_8$$-free graphs12
The Existence of a Path with Two Blocks in Digraphs10
Existential Closure in Line Graphs9
The Eulerian Distribution on the Fixed-Point Free Involutions of the Hyperoctahedral Group Under the Natural Order9
Neighborhood Complexes, Homotopy Test Graphs and an Application to Coloring of Product Graphs8
Monotonic Normalized Heat Diffusion for Regular Bipartite Graphs with Four Eigenvalues8
Super Graphs on Groups, I8
The Sandpile Group of Polygon Rings and Twisted Polygon Rings8
Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree7
Odd Induced Subgraphs in Planar Graphs with Large Girth7
Odd-Even Factors of Graphs6
Hamiltonian Paths and Cycles in Some 4-Uniform Hypergraphs6
A Conjecture on Different Central Parts of Binary Trees6
Disjoint Edges in Geometric Graphs6
Improved Lower Bounds on the Extrema of Eigenvalues of Graphs5
Intersection Graphs of Maximal Sub-polygons of k-Lizards5
Stability on Matchings in 3-Uniform Hypergraphs5
Coloring Graphs in Oriented Coloring of Cubic Graphs5
A generalization of a theorem of Nash-Williams5
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles5
Results and Problems on Chorded Cycles: A Survey5
3-Free Strong Digraphs with the Maximum Size5
Injective Edge-Coloring of Graphs with Small Weight5
Perfect One-Factorizations Arising from the Lee Metric5
On Rainbow Quadrilaterals in Colored Point Sets5
Embedding Grid Graphs on Surfaces5
The Ihara-Zeta Function and the Spectrum of the Join of Two Semi-Regular Bipartite Graphs5
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs4
Double Coalitions in Regular Graphs4
New Tools to Study 1-11-Representation of Graphs4
Minimally k-Factor-Critical Graphs for Some Large k4
The Family of Bicircular Matroids Closed Under Duality4
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth4
Semi-strict Chordality of Digraphs4
On Some Subclasses of Oriented Catch Digraphs4
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments4
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven4
New Results on k-independence of Hypergraphs4
The Two-Eyes Lemma: A Linking Problem for Table-Top Necklaces4
The Cordiality Game and the Game Cordiality Number4
2-Reducible Two Paths and Two Edges Constructing a Cycle in $$(2k+1)$$-Edge-Connected Graphs4
Group-Annihilator Graphs Realised by Finite Abelian Groups and Its Properties4
On Non-degenerate Berge–Turán Problems4
The Eulerian Distribution on k-Colored Involutions4
On the Proper Arc Labeling of Directed Graphs4
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard3
On Generalized Turán Numbers of Intersecting Cliques3
Ramsey Numbers of 5-Uniform Loose Cycles3
Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs3
On Generalized Turán Number of Two Disjoint Cliques3
On Well-Edge-Dominated Graphs3
Ramsey Numbers and Graph Parameters3
Homotopy and Hom Construction in the Category of Finite Hypergraphs3
On the Equitable Choosability of the Disjoint Union of Stars3
A Note on Sullivan’s Second Neighborhood Conjecture3
Maxima of the Q-Spectral Radius of $$C_3$$ ($$C_4$$)-Free Graphs with Given Size and Minimum Degree $$\delta \ge 2$$3
A Classification of Hyperfocused 12-Arcs3
Perfect Pseudo-Matchings in Cubic Graphs3
Kissing Numbers for Balls with Varying Radii3
Bipartite Ramsey Numbers of Cycles for Random Graphs3
The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs3
Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups3
Dimension of Restricted Classes of Interval Orders3
Injectively $$k$$-Colored Rooted Forests3
Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs3
Domination and Outer Connected Domination in Maximal Outerplanar Graphs3
Extremal Graphs for Widom–Rowlinson Colorings in k-Chromatic Graphs3
Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs3
A Note on Coloring $$(4K_1, C_4, C_6)$$-Free Graphs with a $$C_7$$3
Tighter Bounds on Directed Ramsey Number R(7)3
Partition and Disjoint Cycles in Digraphs3
A Note on Extremal Digraphs Containing at Most t Walks of Length k with the Same Endpoints2
Multipermutations and Stirling Multipermutations2
The Turán Numbers of Special Forests2
Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry2
Borodin–Kostochka Conjecture Holds for Odd-Hole-Free Graphs2
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number2
Injective Hulls of Various Graph Classes2
Thin Q-Polynomial Distance-Regular Graphs Have Bounded $$c_2$$2
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 22
Correction: A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs2
On the 3-Color Ramsey Numbers $$R(C_4,C_4,W_{n})$$2
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric2
The $$p-$$Arboricity of Outerplanar Graphs2
Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest2
On the Size of $$(K_t, P_k)$$-Co-Critical Graphs2
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding2
Correction to: Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q2
Diameter of Io-Decomposable Riordan Graphs of the Bell Type2
Weak-Dynamic Coloring of Graphs Beyond-Planarity2
Some Statistics on Generalized Motzkin Paths with Vertical Steps2
The Bounds of Rigid Sphere Design2
Triangle-Free Subgraphs of Hypergraphs2
A Simple Proof of Ore’s Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter2
On Sufficient Conditions for Planar Graphs to be 5-Flexible2
Partition Lattice with Limited Block Sizes2
Conflict-Free Connection Number of Graphs with Four Bridges2
Panconnectivity in Bipartite Graphs with Large Degree sum2
Infinite Ramsey-Minimal Graphs for Star Forests2
Weighted Dyck Paths with Special Restrictions on the Levels of Valleys2
Constructions of Sarvate-Beam Group Divisible Designs2
A Q-Polynomial Structure Associated with the Projective Geometry $$L_N(q)$$2
H-Kernels by Walks2
Graphs with Positive Ricci Curvature2
Star-Critical Ramsey Numbers Involving Large Generalized Fans2
Flip colouring of graphs2
A Class of Cubic Graphs Satisfying Berge Conjecture2
Ramsey Numbers for Multiple Copies of Hypergraphs2
Exact Decompositions and Zero-Divisor Graphs2
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth2
Hamiltonian Cycles and Tight Cutsets2
An Anti-Ramsey Theorem of k-Restricted Edge-Cuts2
On Maximal Det-Independent (Res-Independent) Sets in Graphs2
On Independent Domination in Direct Products2
The Explorer–Director Game on Graphs2
Topological Inductive Constructions for Tight Surface Graphs2
Correction to: Every Cubic Bipartite Graph has a Prime Labeling Except $$K_{3,3}$$2
Path Saturation Game on Six Vertices2
Correction to: The uvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations2
Strongly Regular Graphs from Pseudocyclic Association Schemes1
The Sharp Upper Bounds on the $$A_{\alpha }$$-Spectral Radius of $$C_4$$-Free Graphs and Halin Graphs1
An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six1
Transitive Subtournaments of k-th Power Paley Digraphs and Improved Lower Bounds for Ramsey Numbers1
When a Decomposable Tournament is $$\{-1,3\}$$-Reconstructible?1
Notes on the Leonard System Classification1
Super Domination in Trees1
The Polychromatic Number of Small Subsets of the Integers Modulo n1
Facial Visibility in Edge Colored Plane Graphs1
On Flipping Edge Sets in Unique Sink Orientations1
Fusions of the generalized Hamming scheme on a strongly-regular graph1
Almost Intersecting Families for Vector Spaces1
Degree Condition for a Digraph to be Supereulerian1
Characterization of $$P_3\cup P_2$$-Equipackable Graphs with $$3m (m\ge 1)$$ Edges1
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters1
Block-Transitive 3-Designs with Block Size At Most 61
Emanation Graph: A Plane Geometric Spanner with Steiner Points1
Optimal Chromatic Bound for ($$P_3\cup P_2$$, House)-Free Graphs1
Ternary Extremal Four-Negacirculant Self-Dual Codes1
Ramsey Numbers of Multiple Copies of Graphs in a Component1
Maximum Rectilinear Crossing Number of Uniform Hypergraphs1
Greedy Routing in Circulant Networks1
Ambush Cops and Robbers1
On the Fixing Sets of Finite Groups1
Automorphism Groups of 2-Token Graph of Cartesian Product of Two Cycles1
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property1
The Generalized Terwilliger Algebra of the Hypercube1
Cyclic arrangements with minimum modulo m winding numbers1
A Deletion–Contraction Relation for the DP Color Function1
Hypergraph Based Berge Hypergraphs1
Generalized Power Domination in Claw-Free Regular Graphs1
Towards Optimal $$\chi $$-Binding Functions of ($$2K_1 \cup K_2$$)-Free Graphs and ($$P_3 \cup K_1$$)-Free Graphs1
Edge-Disjoint Steiner Trees and Connectors in Graphs1
An Upper Bound for the 3-Tone Chromatic Number of Graphs with Maximum Degree 31
The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others1
A Note on Additive Bases of Abelian Groups of Rank 21
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs1
Hamilton Paths in Dominating Graphs of Trees and Cycles1
A Note on Stability for Maximal F-Free Graphs1
Veto Interval Graphs and Variations1
Fashion Game on Planar Graphs1
On a List Variant of the Multiplicative 1-2-3 Conjecture1
Factors with Red–Blue Coloring of Claw-Free Graphs and Cubic Graphs1
Note on Polychromatic Coloring of Hereditary Hypergraph Families1
Projective dimension and regularity of 3-path ideals of unicyclic graphs1
Arc-Antipancyclic Hypertournament1
A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs1
The Chromatic Number of Joins of Signed Graphs1
On the structure of some classes of $$(P_{2}\cup P_{3})$$-free graphs1
Reconstruction of a Coloring from its Homogeneous Sets1
Enumerations of Rational Non-decreasing Dyck Paths with Integer Slope1
Some Results on Berge’s Conjecture and Begin–End Conjecture1
On the Spectra of Simplicial Rook Graphs1
2-Nested Matrices: Towards Understanding the Structure of Circle Graphs1
Ortho-Unit Polygons can be Guarded with at most $$\left\lfloor \frac{n-4}{8} \right\rfloor $$ Guards1
The Number of Copies of $$K_{2,t+1}$$ in a Graph1
On Strict Brambles1
The Odd Chromatic Number of a Planar Graph is at Most 81
Set Systems with Covering Properties and Low VC-Dimension1
On the Linear Arboricity of Graphs with Treewidth at Most Four1
The Antistrong Property for Special Digraph Families1
Erdős-Ko-Rado Theorem for Matrices Over Residue Class Rings1
A Spectral Condition for the Existence of the Square of a Path1
Contractible Edges in Spanning Trees of 3-Connected Graphs1
A Note on Internal Partitions: The 5-Regular Case and Beyond1
Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs1
Ramsey Numbers for Complete Graphs Versus Generalized Fans1
On New Record Graphs Close to Bipartite Moore Graphs1
Systems of Overlap Representation for Families of Intervals1
Characterization of (m, n)-Linked Planar Graphs1
Intersection Numbers of Certain 2-Designs from Finite Fields1
Dynamic Cycles in Edge-Colored Multigraphs1
Homogeneous Coherent Configurations from Spherical Buildings and Other Edge-Coloured Graphs1
Admissible Property of Graphs in Terms of Radius1
A Note on k-Wise Oddtown Problems1
Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees1
Four-vertex traces of finite sets1
Loose Edge-Connection of Graphs1
Frames and Doubly Resolvable Group Divisible Designs with Block Size Three and Index Two1
Graph Profiles as Characters on Bicommutative Hopf Algebras1
Regular Hypermaps with the Automorphism Group $$\hbox {PSL}(3,p)$$1
On Properties of Pebble Assignment Graphs1
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs1
A Matrix for Counting Paths in Acyclic Colored Digraphs1
Complexity of Near-3-Choosability Problem1
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number1
Strong Cliques in Claw-Free Graphs1
On ($$1,C_4$$) One-Factorization and Two Orthogonal ($$2,C_4$$) One-Factorizations of Complete Graphs1
Injective Chromatic Index of $$K_4$$-Minor Free Graphs1
Some More Updates on an Annihilation Number Conjecture: Pros and Cons1
A Note on the Turán Number of an Arbitrary Star Forest1
An Exponential Bound for Simultaneous Embeddings of Planar Graphs1
Weighted Tutte–Grothendieck Polynomials of Graphs1
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph1
Integral and rational graphs in the plane1
A Construction of Optimal 1-Spontaneous Emission Error Designs1
Upper Bounds for the List-Distinguishing Chromatic Number1
The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$1
Stability of Generalized Turán Number for Linear Forests1
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number1
On the Unimodality of Domination Polynomials1
Strong Edge Coloring of Cayley Graphs and Some Product Graphs1
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree1
The Action of the Weyl Group on the $$E_8$$ Root System1
On Restricted Intersections and the Sunflower Problem1
On Extremal Problems on Multigraphs1
On 2-Factors Splitting an Embedded Graph into Two Plane Graphs1
Generalized Turán Problems for Complete Bipartite Graphs1
Structure and Coloring of a Family of ($$P_7, C_5$$)-Free Graphs1
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture1
The Inductive Graph Dimension from the Minimum Edge Clique Cover1
Mutually Orthogonal Sudoku Latin Squares and Their Graphs1
0.10654282569885