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 2020-10-01 to 2024-10-01.)
ArticleCitations
Two sufficient conditions for component factors in graphs17
On local antimagic chromatic number of cycle-related join graphs16
The general position problem on Kneser graphs and on some graph operations14
Domination number of graphs with minimum degree five10
Generalized Turán problems for small graphs8
The Lagrangian density of{;123,234,456} and the Tur\'an number of its extension6
More on signed graphs with at most three eigenvalues6
On the isometric path partition problem6
Bounds on domination parameters in graphs: a brief survey5
On (p,1)-total labelling of some 1-planar graphs5
On distance magic labelings of Hamming graphs and folded hypercubes5
Conflict-free vertex connection number at most 3 and size of graphs5
Coalition graphs of paths, cycles, and trees4
Star-critical Ramsey numbers for cycles versus K_44
On Grundy total domination number in product graphs4
Independence number and packing coloring of generalized Mycielski graphs4
Algorithmic aspects of secure connected domination in graphs4
The neighbor-locating-chromatic number of trees and unicyclic graphs4
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products4
A new framework to approach Vizing's conjecture3
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles3
Large contractible subgraphs of a 3-connected graph3
Coloring squares of planar graphs with small maximum degree3
The crossing number of Cartesian product of 5-wheels with any tree3
Z_2× Z_2-cordial cycle-free hypergraphs2
Determining number and cost of generalized Mycielskian graphs2
Dominating vertex covers: the vertex-edge domination problem2
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs2
Non 1-planarity of lexicographic products of graphs2
Equitable total coloring of corona of cubic graphs2
Coloring of the d^{th} power of the face-centered cubic grid2
Total domination in generalized prisms and a new domination invariant2
Domination, independent domination number and 2-independence number in trees2
Total 2-rainbow domination numbers in trees2
Generalized hypergraph coloring2
Connected coalitions in graphs2
H-kernels in unions of H-colored quasi-transitive digraphs2
Extremal graphs and classification of planar graphs by MC-numbers2
A constructive characterization of vertex cover Roman trees2
A note on the equitable choosability of complete bipartite graphs2
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems2
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions2
A survey on the cyclic coloring and its relaxations2
Minimizing the number of complete bipartite graphs in a Ks-saturated graph1
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs1
Spectral bounds for the zero forcing number of a graph1
Proper rainbow connection number of graphs1
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter1
Triameter of graphs1
Covering the edges of a random hypergraph by cliques1
List edge coloring of planar graphs without 6-cycles with two chords1
The linear arboricity of graphs with low treewidth1
An upper bound on the chromatic number of 2-planar graphs1
Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code1
Well-covered token graphs1
On weakly Turán-good graphs1
Block graphs with large paired domination multisubdivision number1
General sharp upper bounds on the total coalition number1
3-Neighbor bootstrap percolation on grids1
A \sigma3 condition for arbitrarily partitionable graphs1
Restrained domination in self-complementary graphs1
Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph1
Outer connected domination in maximal outerplanar graphs and beyond1
Zero and total forcing dense graphs1
Total 2-domination number in digraphs and its dual parameter1
Bounds on the total double Roman domination number of graphs1
Asymptotic behavior of the edge metric dimension of the random graph1
On list equitable total colorings of the generalized theta graph1
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each1
Cubic graphs having only k-cycles in each 2-factor1
Panchromatic patterns by paths1
Graph operations and neighborhood polynomials1
Graph classes equivalent to 12-representable graphs1
An extremal problem for the neighborhood Lights Out game1
Degree sum condition for the existence of spanning k-trees in star-free graphs1
Connectedness and cycle spaces of friends-and-strangers graphs1
The matching extendability of 7-connected maximal 1-plane graphs1
On walk domination: weakly toll domination, l2 and l3 domination1
On the \rho-subdivision number of graphs1
Internally 4-connected graphs with no {;CUBE, V_8}-minor1
On proper (strong) rainbow connection of graphs1
Strong incidence colouring of graphs1
On edge H-irregularity strengths of some graphs1
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 61
Spectra of orders for k-regular graphs of girth g1
Rainbow disjoint union of clique and matching in edge-colored complete graph1
The vertex- rainbow connection number of some graph operations1
Capture-time extremal cop-win graphs1
Critical and flow-critical snarks coincide1
On the k-independence number of graph products1
A note about monochromatic components in graphs of large minimum degree1
Hop domination in chordal bipartite graphs1
A novel approach to covers of multigraphs with semi-edges1
The generalized 3-connectivity and 4-connectivity of crossed cube1
The Turán number of three disjoint paths1
0.023743152618408