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 2021-06-01 to 2025-06-01.)
ArticleCitations
An upper bound on the chromatic number of 2-planar graphs21
The triangle-free graphs that are competition graphs of multipartite tournaments9
Cubic graphs having only k-cycles in each 2-factor8
Connectedness and cycle spaces of friends-and-strangers graphs5
Bounds on domination parameters in graphs: a brief survey5
Spectral bounds for the zero forcing number of a graph5
The m-bipartite Ramsey number BRm(H1,H2)4
Hamiltonian properties in generalized lexicographic products3
Antidirected spanning trail of digraphs with \alpha2-stable number 33
Bounds on the k-conversion number3
Biholes in balanced bipartite graphs3
The decycling number of a planar graph covered by K4-subgraphs3
The matching extendability of 7-connected maximal 1-plane graphs3
The structure of 2-matching connected graphs2
$(k,H)$-kernels in nearly tournaments2
Resistance in regular class two graphs2
Dominated pair degree sum conditions of supereulerian digraphs2
High-ordered spectral characterization of unicyclic graphs2
Tight description of faces in toroidal graphs with minimum degree at least 42
Semitotal forcing in claw-free cubic graphs2
Bounds on coloring trees without rainbow paths2
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree2
Total {2}-domination in a graph and its complement2
Strong chromatic index of claw-free graphs with edge weight seven2
Vertex-edge domination in interval and bipartite permutation graphs2
A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs2
On q-connected chordal graphs with minimum number of spanning trees2
The graph grabbing game on blow-ups of trees and cycles1
Total 2-domination number in digraphs and its dual parameter1
Some results on the global triple Roman domination in graphs1
The niche graphs of multipartite tournaments1
$\ell$-covering $k$-hypergraphs are quasi-eulerian1
The generalized 3-connectivity and 4-connectivity of crossed cube1
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number1
Hop domination in chordal bipartite graphs1
A note about monochromatic components in graphs of large minimum degree1
An extremal problem for the neighborhood Lights Out game1
Connected coalitions in graphs1
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence1
Some upper bounds on Ramsey numbers involving C41
Total vertex product irregularity strength of graphs1
Anti-Ramsey number of union of 5-path and matching1
The generalized Turán problem of two intersecting cliques1
Double dominating sequences in bipartite and co-bipartite graphs1
Characterization of \alpha-excellent 2-trees1
General sharp upper bounds on the total coalition number1
Chromatic Ramsey numbers of generalised Mycielski graphs1
Linear arboricity of 1-planar graphs1
Graph grabbing game on graphs with forbidden subgraphs1
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs1
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs1
On distance magic labelings of Hamming graphs and folded hypercubes1
The achromatic number of the Cartesian product of K6 and Kq1
On (r,c)-constant, planar and circulant graphs1
On the k-independence number of graph products1
End super dominating sets in graphs1
A novel approach to covers of multigraphs with semi-edges1
0.095180988311768