Discussiones Mathematicae Graph Theory

Papers
(The TQCC of Discussiones Mathematicae Graph Theory 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
An upper bound on the chromatic number of 2-planar graphs22
The triangle-free graphs that are competition graphs of multipartite tournaments16
Spectral bounds for the zero forcing number of a graph16
Cubic graphs having only k-cycles in each 2-factor10
The matching extendability of 7-connected maximal 1-plane graphs7
Hamiltonian properties in generalized lexicographic products5
The m-bipartite Ramsey number BRm(H1,H2)5
Tight description of faces in toroidal graphs with minimum degree at least 44
Bounds on the k-conversion number4
Connectedness and cycle spaces of friends-and-strangers graphs4
Biholes in balanced bipartite graphs4
The decycling number of a planar graph covered by K4-subgraphs4
Antidirected spanning trail of digraphs with \alpha2-stable number 34
On S -packing edge-coloring of graphs with given edge weight4
Strong chromatic index of claw-free graphs with edge weight seven3
Resistance in regular class two graphs3
Bounds on coloring trees without rainbow paths3
Unicyclic graphs for which the domination and m -eternal domination numbers are equal3
$(k,H)$-kernels in nearly tournaments3
Total {2}-domination in a graph and its complement3
Semitotal forcing in claw-free cubic graphs3
Parity conditions for one-way rail networks3
The structure of 2-matching connected graphs3
Vertex-edge domination in interval and bipartite permutation graphs3
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs2
Dominated pair degree sum conditions of supereulerian digraphs2
On q-connected chordal graphs with minimum number of spanning trees2
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs2
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs2
Graph grabbing game on graphs with forbidden subgraphs2
Total vertex product irregularity strength of graphs2
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree2
The niche graphs of multipartite tournaments2
Some upper bounds on Ramsey numbers involving C42
On covers and domination in trees2
Some results on the global triple Roman domination in graphs2
A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs2
Sufficient conditions for graphs with path-chromatic number 22
High-ordered spectral characterization of unicyclic graphs2
The Roman domatic problem in graphs and digraphs II: A survey2
The palette Index of some Cartesian products of graphs2
Linear arboricity of 1-planar graphs2
Chromatic Ramsey numbers of generalised Mycielski graphs1
Total 2-domination number in digraphs and its dual parameter1
$\ell$-covering $k$-hypergraphs are quasi-eulerian1
Double dominating sequences in bipartite and co-bipartite graphs1
A note about monochromatic components in graphs of large minimum degree1
Critical aspects in broadcast domination1
Number of cliques of Paley-type graphs over finite commutative local rings1
A novel approach to covers of multigraphs with semi-edges1
Semitotal domination in claw-free graphs1
Coalition graphs of paths, cycles, and trees1
An extremal problem for the neighborhood Lights Out game1
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number1
On distance magic labelings of Hamming graphs and folded hypercubes1
Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans1
Connected coalitions in graphs1
The graph grabbing game on blow-ups of trees and cycles1
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence1
Bootstrap percolation and P 3 -hull number in direct products of graphs1
On nut graphs with two vertex and three edge orbits1
Disjoint maximal independent sets in graphs and hypergraphs1
Extremal graphs for even linear forests in bipartite graphs1
All tight descriptions of faces in plane triangulations with minimum degree 41
Anti-Ramsey number of union of 5-path and matching1
On the chromatic number of {\text{bull, diamond}} -free graphs1
On (r,c)-constant, planar and circulant graphs1
On the k-independence number of graph products1
The generalized Turán problem of two intersecting cliques1
End super dominating sets in graphs1
The achromatic number of the Cartesian product of K6 and Kq1
On infinite sequences of minimal graphs containing monochromatic triangles for any edge 2-coloring1
Bounds for packing chromatic number of some subclasses of trees1
Burning disjoint union of spider and path1
On the regularity, planarity and edge bounds of link-irregular graphs1
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs1
Walecki tournaments with an arc that lies in a unique directed triangle1
General sharp upper bounds on the total coalition number1
Approximate and exact results for the harmonious chromatic number1
The generalized 3-connectivity and 4-connectivity of crossed cube1
Liar's vertex-edge domination in unit disk graph1
On the \rho-subdivision number of graphs1
Hop domination in chordal bipartite graphs1
Characterization of \alpha-excellent 2-trees1
Maximum common induced subforests and minimum common induced superforests of a set of forests1
0.17267203330994