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