Graphs and Combinatorics

Papers
(The median citation count of Graphs and Combinatorics is 0. 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-08-01 to 2026-08-01.)
ArticleCitations
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent $$4^-$$-Cycles23
Erdős–Gyárfás conjecture for $$P_8$$-free graphs11
The Eulerian Distribution on the Fixed-Point Free Involutions of the Hyperoctahedral Group Under the Natural Order11
Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree10
Existential Closure in Line Graphs10
The Existence of a Path with Two Blocks in Digraphs9
Disjoint Edges in Geometric Graphs9
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs9
Higher-dimensional counterexamples to Hamiltonicity9
A Conjecture on Different Central Parts of Binary Trees9
Odd-Even Factors of Graphs8
Results and Problems on Chorded Cycles: A Survey8
Injective Split Systems8
On the structure of (dart, odd hole)-free graphs8
A generalization of a theorem of Nash-Williams7
On Some Subclasses of Oriented Catch Digraphs7
Improved Lower Bounds on the Extrema of Eigenvalues of Graphs7
An equitable partition for the distance-regular graph of the bilinear forms7
Perfect One-Factorizations Arising from the Lee Metric7
Coloring Graphs in Oriented Coloring of Cubic Graphs7
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs6
On Rainbow Quadrilaterals in Colored Point Sets6
The Cordiality Game and the Game Cordiality Number6
$$K_{1,2,2,2}$$ has no n-fold planar cover for $$n<14$$6
Intersection Graphs of Maximal Sub-polygons of k-Lizards6
Injective Edge-Coloring of Graphs with Small Weight5
Double Coalitions in Regular Graphs5
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments5
Kissing Numbers for Balls with Varying Radii5
On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs5
2-Reducible Two Paths and Two Edges Constructing a Cycle in $$(2k+1)$$-Edge-Connected Graphs5
New Results on k-independence of Hypergraphs5
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven5
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles5
New Tools to Study 1-11-Representation of Graphs5
The Eulerian Distribution on k-Colored Involutions5
Semi-strict Chordality of Digraphs4
Ramsey Numbers and Graph Parameters4
Minimally k-Factor-Critical Graphs for Some Large k4
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth4
Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs4
On Non-degenerate Berge–Turán Problems4
Canonical Binary $$\Delta $$-Matroids4
Tighter Bounds on Directed Ramsey Number R(7)4
Graphs with Positive Ricci Curvature3
Extremal Graphs for Widom–Rowlinson Colorings in k-Chromatic Graphs3
Maxima of the Q-Spectral Radius of $$C_3$$ ($$C_4$$)-Free Graphs with Given Size and Minimum Degree $$\delta \ge 2$$3
Dimension of Restricted Classes of Interval Orders3
A Note on Coloring $$(4K_1, C_4, C_6)$$-Free Graphs with a $$C_7$$3
Isolation Game on Graphs3
Partition and Disjoint Cycles in Digraphs3
A Note on Sullivan’s Second Neighborhood Conjecture3
Weak-Dynamic Coloring of Graphs Beyond-Planarity3
The $$p-$$Arboricity of Outerplanar Graphs3
Path Saturation Game on Six Vertices3
Connected Matchings in Graphs with Independence Number Two3
Injectively $$k$$-Colored Rooted Forests3
On Generalized Turán Numbers of Intersecting Cliques3
Closed Neighborhood Balanced Coloring of Graphs3
A Classification of Hyperfocused 12-Arcs3
On the Equitable Choosability of the Disjoint Union of Stars3
Homotopy and Hom Construction in the Category of Finite Hypergraphs3
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding3
Hamiltonian Cycles and Tight Cutsets3
Correction to: The uvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations3
Correction to: A Comparison of the Grundy and b-Chromatic Number of $$K_{2,t}$$ -Free Graphs3
Euclidean 2-Designs as Stationary Points of Many-Body Systems3
Visibility in Hypercubes3
Perfect Pseudo-Matchings in Cubic Graphs3
The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs3
Anti-Ramsey Numbers of Loose Paths and Cycles in Uniform Hypergraphs3
Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups3
Proof of a conjecture of Xiao and Zamora3
Correction to: Every Cubic Bipartite Graph has a Prime Labeling Except $$K_{3,3}$$3
Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry3
On the Size of $$(K_t, P_k)$$-Co-Critical Graphs3
The Explorer–Director Game on Graphs2
A Tight Bound on the Size of a Smallest Critical Set for Each Failed Edge in a Tree Spanner2
Odd coloring of signed graphs2
A Q-Polynomial Structure Associated with the Projective Geometry $$L_N(q)$$2
Multipermutations and Stirling Multipermutations2
Star-Critical Ramsey Numbers Involving Large Generalized Fans2
Upper-embeddability and the decycling number of connected 4-regular graphs2
Algorithmic and structural results of directed Steiner path packing and directed path connectivity2
Correction: A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs2
Exact Decompositions and Zero-Divisor Graphs2
On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours2
The Number of Copies of $$K_{2,t+1}$$ in a Graph2
Isolation of Connected Graphs in Terms of Size2
Characterization of $$P_3\cup P_2$$-Equipackable Graphs with $$3m (m\ge 1)$$ Edges2
Borodin–Kostochka Conjecture Holds for Odd-Hole-Free Graphs2
On the structure of some classes of $$(P_{2}\cup P_{3})$$-free graphs2
Infinite Ramsey-Minimal Graphs for Star Forests2
Word-Representation of Melon Graphs2
Panconnectivity in Bipartite Graphs with Large Degree sum2
Note on Polychromatic Coloring of Hereditary Hypergraph Families2
Prime Sum Graphs and the Induced Trees They Contain2
Correction to: Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q2
Frames and Doubly Resolvable Group Divisible Designs with Block Size Three and Index Two2
On Flipping Edge Sets in Unique Sink Orientations2
The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others2
Dichromatic number of chordal graphs2
Regular generalized cayley maps of elementary abelian p-groups2
A Classification of Disconnected Graphs with Exactly One Cycle by Their Dot Product Dimension2
On Independent Domination in Direct Products2
Total Coalitions in Claw-Free Cubic Graphs Containing Double-Bonded Triangle-Units2
A Simple Proof of Ore’s Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter2
Partition Lattice with Limited Block Sizes2
Ramsey Numbers of Multiple Copies of Graphs in a Component2
Flip colouring of graphs2
Integer Sequences Generated by the Determinants of Matrices Associated with Threshold Graphs2
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric2
Spanning Trees with Few Branch Vertices in a Chair-Free Graph2
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 22
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth2
Claw-Free Solid Bricks2
Regular Hypermaps with the Automorphism Group $$\hbox {PSL}(3,p)$$2
Conflict-Free Connection Number of Graphs with Four Bridges2
Toroidal Cartesian Products Where One Factor is 3-Connected2
Upper Bounds for the List-Distinguishing Chromatic Number2
The Bounds of Rigid Sphere Design2
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs2
Some Statistics on Generalized Motzkin Paths with Vertical Steps2
Emanation Graph: A Plane Geometric Spanner with Steiner Points2
Topological Inductive Constructions for Tight Surface Graphs2
On the Spectra of Simplicial Rook Graphs2
Thin Q-Polynomial Distance-Regular Graphs Have Bounded $$c_2$$2
Ramsey Numbers for Multiple Copies of Hypergraphs2
Set Systems with Covering Properties and Low VC-Dimension2
Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest2
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number2
Graph Profiles as Characters on Bicommutative Hopf Algebras1
Dynamic Cycles in Edge-Colored Multigraphs1
Extensions of Moon’s and Bagga and Beineke’s theorems on dicycle and score (outdegree) structures of tournaments1
A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs1
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture1
A Note on Internal Partitions: The 5-Regular Case and Beyond1
Characterization of Plotkin-optimal two-weight codes over finite chain rings and some applications1
Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments1
On Restricted Intersections and the Sunflower Problem1
Neighborhood 3-Balanced Graphs1
Fusions of the generalized Hamming scheme on a strongly-regular graph1
A note on vertex Turán problems in the Kneser cube1
Maximum Rectilinear Crossing Number of Uniform Hypergraphs1
On the Fixing Sets of Finite Groups1
Transitive Subtournaments of k-th Power Paley Digraphs and Improved Lower Bounds for Ramsey Numbers1
The Generalized Terwilliger Algebra of the Hypercube1
Ternary Extremal Four-Negacirculant Self-Dual Codes1
Loose Edge-Connection of Graphs1
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph1
On Tutte Cycles Containing Three Prescribed Edges1
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs1
Injective Edge-Colorings of $$K_4$$-Minor Free Graphs1
Spectral Conditions for a Graph to have Strong Parity Factors1
Injective Chromatic Index of $$K_4$$-Minor Free Graphs1
Structure and Coloring of a Family of ($$P_7, C_5$$)-Free Graphs1
The burning number conjecture holds for trees of order n with at most $$\left\lfloor \sqrt{n-1}\right\rfloor $$ degree-2 vertices1
Rainbow Hamiltonicity with large edge numbers1
An Upper Bound for the 3-Tone Chromatic Number of Graphs with Maximum Degree 31
Optimal Chromatic Bound for ($$P_3\cup P_2$$, House)-Free Graphs1
On Strict Brambles1
Four-vertex traces of finite sets1
Integral and rational graphs in the plane1
The Generalized Motzkin Family1
An Exponential Bound for Simultaneous Embeddings of Planar Graphs1
On Intersection Graphs of Spherical Caps1
Reconstruction of a Coloring from its Homogeneous Sets1
Projective dimension and regularity of 3-path ideals of unicyclic graphs1
Coefficients of the Matching Polynomial of a Self-Complementary Graph1
Intersection Numbers of Certain 2-Designs from Finite Fields1
A New Connectivity Bound for a Tournament to be Highly Linked1
A Construction of Optimal 1-Spontaneous Emission Error Designs1
Ramsey Numbers for Complete Graphs Versus Generalized Fans1
All generalized rose window graphs are hamiltonian1
New Counterexamples to a Conjecture by Woodall on Graph Minors and List Coloring1
Towards Optimal $$\chi $$-Binding Functions of ($$2K_1 \cup K_2$$)-Free Graphs and ($$P_3 \cup K_1$$)-Free Graphs1
Borodin–Kostochka’s Conjecture on $$\{P_2\cup P_3,C_4\}$$-Free Graphs1
A Matrix for Counting Paths in Acyclic Colored Digraphs1
Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees1
A note on strongly and totally chain intersecting families1
Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number1
Automorphism Groups of 2-Token Graph of Cartesian Product of Two Cycles1
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property1
Region Crossing Change on Plane Trivalent Graphs1
Weighted Tutte–Grothendieck Polynomials of Graphs1
Diameter Three Orientability of Mixed Bipartite Graphs1
Contractible Edges in Spanning Trees of 3-Connected Graphs1
Strong Arboricity of Graphs1
Almost Intersecting Families for Vector Spaces1
Stability of Generalized Turán Number for Linear Forests1
On Extremal Problems on Multigraphs1
Partitioning Edge-Colored Graphs with Constrained Color Degrees1
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree1
When a Decomposable Tournament is $$\{-1,3\}$$-Reconstructible?1
A Note on Additive Bases of Abelian Groups of Rank 21
The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$1
Complexity of Near-3-Choosability Problem1
On the Number of Drawings of a Combinatorial Triangulation1
Generalized Turán Problems for Complete Bipartite Graphs1
Veto Interval Graphs and Variations1
The Odd Chromatic Number of a Planar Graph is at Most 81
Ortho-Unit Polygons can be Guarded with at most $$\left\lfloor \frac{n-4}{8} \right\rfloor $$ Guards1
Hamilton Paths in Dominating Graphs of Trees and Cycles1
Star-Critical Gallai–Ramsey Numbers of Graphs1
Characterization of (m, n)-Linked Planar Graphs1
Some More Updates on an Annihilation Number Conjecture: Pros and Cons1
Edge-Disjoint Steiner Trees and Connectors in Graphs1
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs1
Indicated multifold-choosability of graphs1
Neighbor sum distinguishing index of $$K_4$$-minor free graphs1
Strongly Regular Graphs from Pseudocyclic Association Schemes1
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters1
On the Linear Arboricity of Graphs with Treewidth at Most Four1
Mutually Orthogonal Sudoku Latin Squares and Their Graphs1
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number1
Correction: Callan permutations and odd order permutations1
The Structure of Minimally 1-Tough Graphs with Small Independence Number0
Analytic Properties of Forcing and Anti-Forcing Polynomials of Pyrene Chains0
Settling the Nonorientable Genus of the Nearly Complete Bipartite Graphs0
Perfect codes and total perfect codes in intersection graphs of finite groups0
Weak Dynamic Coloring of Planar Graphs0
Proper Edge Colorings of Cartesian Products with Rainbow $$C_4$$-s0
On a Family of Divisible Design Digraphs0
Tashkinov-Trees: an Annotated Proof0
Some Two-Weight Codes Over Chain Rings and their Strongly Regular Graphs0
Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree0
A Tight Linear Bound to the Chromatic Number of $$(P_5, K_1+(K_1\cup K_3))$$-Free Graphs0
The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number0
Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs0
Ramsey numbers of large books versus multipartite graphs0
Isoperimetric Formulas for Hyperbolic Animals0
Parameters of Quotient-Polynomial Graphs0
On 4-Sachs Optimal Graphs0
List Dynamic 4-Coloring of Planar Graphs0
On the d-independence number in 1-planar graphs0
Two and Three-color Rado numbers for $$x_1+x_2+\cdots +x_n=y^2$$0
The Maximum Sum of Sizes of Non-Empty Cross t-Intersecting Families0
Gallai–Ramsey Numbers for Paths0
A note on a new result related to Chartrand, Kaugars and Lick’s theorem0
Seymour’s second neighborhood conjecture for some oriented graphs0
Using a Grassmann Graph to Recover the Underlying Projective Geometry0
An infinite family of snarks with perfect matching cover index 40
The Distribution of Roots of Ehrhart Polynomials for the Dual of Root Polytopes of Type C0
Non-perfect $$(P_5, C_5, K_5-e)$$-Free Graphs are 5-Colorable0
Local Degree Conditions for Hamiltonicity of Claw-Free Graphs0
On Dirac and Motzkin Problem in Discrete Geometry0
2-Distance List $$(\varDelta +3)$$-Coloring of Sparse Graphs0
Independence Number and Maximal Chromatic Polynomials of Connected Graphs0
Decomposing 2k-Regular Graphs into Paths of Length k0
$$12\cdots t$$-Permutation Avoiding (0, 1)-Matrices0
0.11814093589783