Discussiones Mathematicae Graph Theory

Article	Citations
Two sufficient conditions for component factors in graphs	17
On local antimagic chromatic number of cycle-related join graphs	16
The general position problem on Kneser graphs and on some graph operations	14
Domination number of graphs with minimum degree five	10
Generalized Turán problems for small graphs	8
More on signed graphs with at most three eigenvalues	6
On the isometric path partition problem	6
The Lagrangian density of{;123,234,456} and the Tur\'an number of its extension	6
On distance magic labelings of Hamming graphs and folded hypercubes	5
Conflict-free vertex connection number at most 3 and size of graphs	5
Bounds on domination parameters in graphs: a brief survey	5
On (p,1)-total labelling of some 1-planar graphs	5
On Grundy total domination number in product graphs	4
Independence number and packing coloring of generalized Mycielski graphs	4
Algorithmic aspects of secure connected domination in graphs	4
The neighbor-locating-chromatic number of trees and unicyclic graphs	4
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products	4
Coalition graphs of paths, cycles, and trees	4
Star-critical Ramsey numbers for cycles versus K_4	4
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles	3
Large contractible subgraphs of a 3-connected graph	3
Coloring squares of planar graphs with small maximum degree	3
The crossing number of Cartesian product of 5-wheels with any tree	3
A new framework to approach Vizing's conjecture	3
Dominating vertex covers: the vertex-edge domination problem	2

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs	2
Non 1-planarity of lexicographic products of graphs	2
Equitable total coloring of corona of cubic graphs	2
Coloring of the d^{th} power of the face-centered cubic grid	2
Total domination in generalized prisms and a new domination invariant	2
Domination, independent domination number and 2-independence number in trees	2
Total 2-rainbow domination numbers in trees	2
Generalized hypergraph coloring	2
Connected coalitions in graphs	2
H-kernels in unions of H-colored quasi-transitive digraphs	2
Extremal graphs and classification of planar graphs by MC-numbers	2
A constructive characterization of vertex cover Roman trees	2
A note on the equitable choosability of complete bipartite graphs	2
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems	2
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions	2
A survey on the cyclic coloring and its relaxations	2
Z_2× Z_2-cordial cycle-free hypergraphs	2
Determining number and cost of generalized Mycielskian graphs	2
Bounds on the total double Roman domination number of graphs	1
On weakly Turán-good graphs	1
Block graphs with large paired domination multisubdivision number	1
General sharp upper bounds on the total coalition number	1
3-Neighbor bootstrap percolation on grids	1
Restrained domination in self-complementary graphs	1
Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph	1
Zero and total forcing dense graphs	1
Total 2-domination number in digraphs and its dual parameter	1
Asymptotic behavior of the edge metric dimension of the random graph	1
On list equitable total colorings of the generalized theta graph	1
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each	1
Cubic graphs having only k-cycles in each 2-factor	1
Panchromatic patterns by paths	1
On walk domination: weakly toll domination, l2 and l3 domination	1
Graph operations and neighborhood polynomials	1
On proper (strong) rainbow connection of graphs	1
Graph classes equivalent to 12-representable graphs	1
An extremal problem for the neighborhood Lights Out game	1
Degree sum condition for the existence of spanning k-trees in star-free graphs	1
Connectedness and cycle spaces of friends-and-strangers graphs	1
The matching extendability of 7-connected maximal 1-plane graphs	1
On the \rho-subdivision number of graphs	1
Internally 4-connected graphs with no {;CUBE, V_8}-minor	1
Strong incidence colouring of graphs	1
On edge H-irregularity strengths of some graphs	1
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6	1
Spectra of orders for k-regular graphs of girth g	1
Rainbow disjoint union of clique and matching in edge-colored complete graph	1
The vertex- rainbow connection number of some graph operations	1
Capture-time extremal cop-win graphs	1
Minimizing the number of complete bipartite graphs in a Ks-saturated graph	1

Critical and flow-critical snarks coincide	1
Proper rainbow connection number of graphs	1
On the k-independence number of graph products	1
A note about monochromatic components in graphs of large minimum degree	1
Hop domination in chordal bipartite graphs	1
A novel approach to covers of multigraphs with semi-edges	1
The Turán number of three disjoint paths	1
The generalized 3-connectivity and 4-connectivity of crossed cube	1
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs	1
Spectral bounds for the zero forcing number of a graph	1
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter	1
Triameter of graphs	1
Covering the edges of a random hypergraph by cliques	1
List edge coloring of planar graphs without 6-cycles with two chords	1
The linear arboricity of graphs with low treewidth	1
An upper bound on the chromatic number of 2-planar graphs	1
A \sigma3 condition for arbitrarily partitionable graphs	1
Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code	1
Outer connected domination in maximal outerplanar graphs and beyond	1
Well-covered token graphs	1
On subgraphs with prescribed eccentricities	0
Contractible subgraphs of quasi 5-connected graphs	0
On independent coalition in graphs and independent coalition graphs	0
Tight description of faces in toroidal graphs with minimum degree at least 4	0
A Chvátal-Erdős type theorem for path-connectivity	0
Colorings of plane graphs without long monochromatic facial paths	0
On a graph labelling conjecture involving coloured labels	0
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence	0
Edge coloring of products of signed graphs	0
Characterization of \alpha-excellent 2-trees	0
Biholes in balanced bipartite graphs	0
$L(p,q)$-labeling of graphs with interval representations	0
Dualizing distance-hereditary graphs	0
High-ordered spectral characterization of unicyclic graphs	0
On (r,c)-constant, planar and circulant graphs	0
Spanning trails avoiding and containing given edges	0
Chromatic Ramsey numbers of generalised Mycielski graphs	0
New results on Type 2 snarks	0
Independent transversal total domination versus total domination in trees	0
Antidirected spanning trail of digraphs with \alpha2-stable number 3	0
Strong and weak Perfect Digraph Theorems for perfect, \alpha-perfect and strictly perfect digraphs	0
On the vertex position number of graphs	0
Approximate and exact results for the harmonious chromatic number	0
Edge intersection hypergraphs	0
Total and paired domination stability in prisms	0
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs	0
$(I,F)$-partition of planar graphs without cycles of length 4, 6, or 9	0
Changing and unchanging of the domination number of a graph: path addition numbers	0
Edge precoloring extension of trees II	0
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree	0
$(k,H)$-kernels in nearly tournaments	0
The decycling number of a planar graph covered by K4-subgraphs	0
The generalized 4-connectivity of balanced hypercubes	0
$\ell$-covering $k$-hypergraphs are quasi-eulerian	0
Restrained differential of a graph	0
Set-sequential labelings of odd trees	0
Chorded k-pancyclic and weakly k-pancyclic graphs	0
On P5-free locally split graphs	0
Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten	0
The decycling number of a graph with large girth embedded in a surface	0
The graph grabbing game on blow-ups of trees and cycles	0
Lower boundary independent broadcasts in trees	0
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs	0
Lower boundary independent and hearing independent broadcasts in graphs	0
Minimal graphs with disjoint dominating and paired-dominating sets	0
Coverings of cubic graphs and 3-edge colorability	0
Twins in ordered hyper-matchings	0
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number	0
On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs	0
Bounds on the k-conversion number	0
Some upper bounds on Ramsey numbers involving C4	0
Resistance in regular class two graphs	0
The Petersen and Heawood graphs make up graphical twins via induced matchings	0
Double Roman and double Italian domination	0
On semisymmetric cubic graphs of order 20p^2, p prime	0
On link-irregular graphs	0
Dissociation in circulant graphs and integer distance graphs	0
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$	0
Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments	0
Double total dominator chromatic number of graphs	0

On singular signed graphs with nullspace spanned by a full vector: signed nut graphs	0
On the broadcast independence number of locally uniform 2-lobsters	0
Decomposition of complete graphs into forests with six edges	0
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs	0
The achromatic number of K6\square Kq equals 2q+3 if q\ge41 is odd	0
Fair total domination number in cactus graphs	0
On the total domination number of total graphs	0
Domination in graphs and the removal of a matching	0
Online size Ramsey number for C4 and P6	0
Global dominated coloring of graphs	0
On the Strong Path Partition Conjecture	0
The triangle-free graphs that are competition graphs of multipartite tournaments	0
Strong chromatic index of claw-free graphs with edge weight seven	0
Spanning trees with a bounded number of branch vertices in a K1,4-free graph	0
Hamiltonian properties in generalized lexicographic products	0
Sufficient conditions for spanning trees with constrained leaf distance in a graph	0
Beta invariant and chromatic uniqueness of wheels	0
Choosability with separation of cycles and outerplanar graphs	0
An analogue of quasi-transitivity for edge-coloured graphs	0
The achromatic number of the Cartesian product of K6 and Kq	0
Graph exponentiation and neighborhood reconstruction	0
Linear arboricity of 1-planar graphs	0
The directed uniform Hamilton-Waterloo Problem involving even cycle sizes	0
Preface 2019	0
Number of cliques of Paley-type graphs over finite commutative local rings	0
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs	0
On the n-partite tournaments with exactly n-m+1 cycles of length m	0
Lower general position sets in graphs	0
Minimal graphs with disjoint dominating and total dominating sets	0
On the equality of domination number and 2-domination number	0
Corrigendum to "Minimum edge cuts in diameter 2 graphs"	0
On \mathcal P vertex-connections of graphs	0
Intersection dimension and graph invariants	0
Outpaths of arcs in regular 3-partite tournaments	0
Extremal graphs for even linear forests in bipartite graphs	0
Critical aspects in broadcast domination	0
The generalized Turán problem of two intersecting cliques	0
The spectrum problem for the connected cubic graphs of order 10	0
The minimum size of a graph with given tree connectivity	0
All tight descriptions of faces in plane triangulations with minimum degree 4	0
On proper 2-labellings distinguishing by sums, multisets or products	0
Forbidden subgraphs for collapsible graphs and supereulerian graphs	0
Relationship among B1-EPG, VPT and EPT graphs classes	0
Some results on the global triple Roman domination in graphs	0
A note on minimum degree, bipartite holes, and Hamiltonian properties	0
End super dominating sets in graphs	0
Total vertex product irregularity strength of graphs	0
Supermagic graphs with many different degrees	0
Adjacent vertex distinguishing total coloring of the corona product of graphs	0
A study of a combination of distance domination and resolvability in graphs	0
Fractional eternal domination: securely distributing resources across a network	0
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph	0
Biregular (and regular) planar cages	0
The niche graphs of multipartite tournaments	0
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs	0
Dominated pair degree sum conditions of supereulerian digraphs	0
The structure of 2-matching connected graphs	0
The m-bipartite Ramsey number BRm(H1,H2)	0
A characterization of uniquely representable graphs	0
Achromatic numbers for circulant graphs and digraphs	0
Equitable cluster partition of graphs with small maximum average degree	0
Bipartite Ramsey number pairs involving cycles	0
Star-critical Ramsey numbers and regular Ramsey numbers for stars	0
Fault-tolerant identifying codes in special classes of graphs	0
Graph grabbing game on graphs with forbidden subgraphs	0
On q-connected chordal graphs with minimum number of spanning trees	0
Semitotal forcing in claw-free cubic graphs	0
Vertex-edge domination in interval and bipartite permutation graphs	0
Equitable choosability of prism graphs	0
On the star chromatic index of generalized Petersen graphs	0
An improved bound on the chromatic number of the Pancake graphs	0
Edge-maximal graphs with cutwidth at most three	0
Degree sum condition for vertex-disjoint 5-cycles	0
Bounds on the global double Roman domination number in graphs	0
Hypergraph operations preserving sc-greediness	0
New bounds on domination and independence in graphs	0
Maximising 1’s through proper labellings	0
A note on packing of uniform hypergraphs	0
Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans	0
Acyclic chromatic index of IC-planar graphs	0
T-colorings, divisibility and circular chromatic number	0
Double dominating sequences in bipartite and co-bipartite graphs	0
Extending partial edge colorings of Cartesian products of graphs	0
2-nearly Platonic graphs	0
Disjoint maximal independent sets in graphs and hypergraphs	0
Retraction Note	0
Alternating-pancyclism in 2-edge-colored graphs	0
Hereditary equality of domination and exponential domination in subcubic graphs	0
Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes	0
On s-hamiltonian-connected line graphs	0
Linear list coloring of some sparse graph	0
Minimal graphs with respect to geometric distance realizability	0
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs	0
The tree-achieving set and non-separating independent set problem of subcubic graphs	0
On antipodal and diametrical partial cubes	0