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-03-01 to 2024-03-01.)
ArticleCitations
Two sufficient conditions for component factors in graphs15
On local antimagic chromatic number of cycle-related join graphs13
The general position problem on Kneser graphs and on some graph operations13
Domination number of graphs with minimum degree five8
The Lagrangian density of{;123,234,456} and the Tur\'an number of its extension6
Generalized Turán problems for small graphs6
More on signed graphs with at most three eigenvalues5
On the isometric path partition problem4
On (p,1)-total labelling of some 1-planar graphs4
On distance magic labelings of Hamming graphs and folded hypercubes4
On Grundy total domination number in product graphs4
Conflict-free vertex connection number at most 3 and size of graphs4
A constructive characterization of vertex cover Roman trees3
Star-critical Ramsey numbers for cycles versus K_43
Algorithmic aspects of secure connected domination in graphs3
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
Bounds on the total double Roman domination number of graphs3
The neighbor-locating-chromatic number of trees and unicyclic graphs3
A new framework to approach Vizing's conjecture3
The crossing number of Cartesian product of 5-wheels with any tree3
Coalition graphs of paths, cycles, and trees2
Domination, independent domination number and 2-independence number in trees2
Independence number and packing coloring of generalized Mycielski graphs2
Generalized hypergraph coloring2
H-kernels in unions of H-colored quasi-transitive digraphs2
Z_2× Z_2-cordial cycle-free hypergraphs2
A note on the equitable choosability of complete bipartite graphs2
Total 2-rainbow domination numbers in trees2
Non 1-planarity of lexicographic products of graphs2
Extremal graphs and classification of planar graphs by MC-numbers2
Well-covered token graphs2
Dominating vertex covers: the vertex-edge domination problem2
Bounds on domination parameters in graphs: a brief survey2
Equitable total coloring of corona of cubic graphs2
The matching extendability of 7-connected maximal 1-plane graphs1
Edge degree conditions for dominating and spanning closed trails1
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products1
On proper (strong) rainbow connection of graphs1
A survey on the cyclic coloring and its relaxations1
Cubic graphs having only k-cycles in each 2-factor1
Double Roman and double Italian domination1
Total 2-domination number in digraphs and its dual parameter1
Total domination in generalized prisms and a new domination invariant1
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 61
The linear arboricity of graphs with low treewidth1
Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code1
Critical and flow-critical snarks coincide1
Block graphs with large paired domination multisubdivision number1
The generalized 3-connectivity and 4-connectivity of crossed cube1
Internally 4-connected graphs with no {;CUBE, V_8}-minor1
Coloring of the d^{th} power of the face-centered cubic grid1
An upper bound on the chromatic number of 2-planar graphs1
Outer connected domination in maximal outerplanar graphs and beyond1
Triameter of graphs1
The vertex- rainbow connection number of some graph operations1
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs1
List edge coloring of planar graphs without 6-cycles with two chords1
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter1
Restrained domination in self-complementary graphs1
Determining number and cost of generalized Mycielskian graphs1
Graph operations and neighborhood polynomials1
On the k-independence number of graph products1
Degree sum condition for the existence of spanning k-trees in star-free graphs1
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions1
Connectedness and cycle spaces of friends-and-strangers graphs1
Proper rainbow connection number of graphs1
Spectra of orders for k-regular graphs of girth g1
On the \rho-subdivision number of graphs1
On edge H-irregularity strengths of some graphs1
On list equitable total colorings of the generalized theta graph1
Strong incidence colouring of graphs1
Asymptotic behavior of the edge metric dimension of the random graph1
Rainbow disjoint union of clique and matching in edge-colored complete graph1
Capture-time extremal cop-win graphs1
Panchromatic patterns by paths1
A note about monochromatic components in graphs of large minimum degree1
Coloring squares of planar graphs with small maximum degree1
0.037617206573486