Discussiones Mathematicae Graph Theory

Article	Citations
An upper bound on the chromatic number of 2-planar graphs	21
The triangle-free graphs that are competition graphs of multipartite tournaments	11
Cubic graphs having only k-cycles in each 2-factor	10
Connectedness and cycle spaces of friends-and-strangers graphs	5
Bounds on domination parameters in graphs: a brief survey	5
Bounds on the k-conversion number	5
Spectral bounds for the zero forcing number of a graph	5
The decycling number of a planar graph covered by K4-subgraphs	4
The m-bipartite Ramsey number BRm(H1,H2)	4
Hamiltonian properties in generalized lexicographic products	4
Biholes in balanced bipartite graphs	3
$(k,H)$-kernels in nearly tournaments	3
Tight description of faces in toroidal graphs with minimum degree at least 4	3
Strong chromatic index of claw-free graphs with edge weight seven	3
The matching extendability of 7-connected maximal 1-plane graphs	3
On S-packing edge-coloring of graphs with given edge weight	3
Total {2}-domination in a graph and its complement	2
Vertex-edge domination in interval and bipartite permutation graphs	2
A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs	2
On q-connected chordal graphs with minimum number of spanning trees	2
A characterization of internally 4-connected {P10− {v1,v2}}-minor-free graphs	2
Semitotal forcing in claw-free cubic graphs	2
Resistance in regular class two graphs	2
Bounds on coloring trees without rainbow paths	2
High-ordered spectral characterization of unicyclic graphs	2

Dominated pair degree sum conditions of supereulerian digraphs	2
Antidirected spanning trail of digraphs with \alpha2-stable number 3	2
The structure of 2-matching connected graphs	2
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree	2
Total vertex product irregularity strength of graphs	2
End super dominating sets in graphs	1
Anti-Ramsey number of union of 5-path and matching	1
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence	1
Linear arboricity of 1-planar graphs	1
Some results on the global triple Roman domination in graphs	1
Chromatic Ramsey numbers of generalised Mycielski graphs	1
The generalized 3-connectivity and 4-connectivity of crossed cube	1
On the \rho-subdivision number of graphs	1
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number	1
Double dominating sequences in bipartite and co-bipartite graphs	1
A note about monochromatic components in graphs of large minimum degree	1
On distance magic labelings of Hamming graphs and folded hypercubes	1
Connected coalitions in graphs	1
$\ell$-covering $k$-hypergraphs are quasi-eulerian	1
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs	1
Total 2-domination number in digraphs and its dual parameter	1
General sharp upper bounds on the total coalition number	1
The generalized Turán problem of two intersecting cliques	1
On the k-independence number of graph products	1
An extremal problem for the neighborhood Lights Out game	1
Hop domination in chordal bipartite graphs	1
The graph grabbing game on blow-ups of trees and cycles	1
Graph grabbing game on graphs with forbidden subgraphs	1
Some upper bounds on Ramsey numbers involving C4	1
The niche graphs of multipartite tournaments	1
The achromatic number of the Cartesian product of K6 and Kq	1
A novel approach to covers of multigraphs with semi-edges	1
Characterization of \alpha-excellent 2-trees	1
On (r,c)-constant, planar and circulant graphs	1
The neighbor-locating-chromatic number of trees and unicyclic graphs	0
Minimal graphs with disjoint dominating and total dominating sets	0
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs	0
On the equality of domination number and 2-domination number	0
Decomposition of complete graphs into forests with six edges	0
Recognizable coloring of graphs	0
Corrigendum to "Minimum edge cuts in diameter 2 graphs"	0
A characterization of uniquely representable graphs	0
Set-sequential labelings of odd trees	0
Coloring squares of planar graphs with small maximum degree	0
Twins in ordered hyper-matchings	0
Fault-tolerant identifying codes in special classes of graphs	0
The robust chromatic number of certain graph classes	0
The planar Turán number of {\left { C6, C7 \right }}	0
Some results on the k-alliance and domination of graphs	0
The achromatic number of K6\square Kq equals 2q+3 if q\ge41 is odd	0

Reconstructing a graph from the boundary distance matrix	0
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions	0
The Petersen and Heawood graphs make up graphical twins via induced matchings	0
Domination in graphs and the removal of a matching	0
Panchromatic patterns by paths	0
Graph classes equivalent to 12-representable graphs	0
Two sufficient conditions for component factors in graphs	0
Hamiltonian cycles through a linear forest in bipartite graphs	0
A \sigma3 condition for arbitrarily partitionable graphs	0
Strong incidence colouring of graphs	0
Acyclic chromatic index of IC-planar graphs	0
$(I,F)$-partition of planar graphs without cycles of length 4, 6, or 9	0
Zero and total forcing dense graphs	0
Restrained differential of a graph	0
Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes	0
Disjoint maximal independent sets in graphs and hypergraphs	0
The generalized 4-connectivity of balanced hypercubes	0
The excluded minor theorem for the Petersen graph contracting exactly two edges of a perfect matching and one other edge	0
On s-hamiltonian-connected line graphs	0
Extending partial edge colorings of Cartesian products of graphs	0
On weakly Turán-good graphs	0
Adjacent vertex distinguishing total coloring of the corona product of graphs	0
Fractional eternal domination: securely distributing resources across a network	0
Approximate and exact results for the harmonious chromatic number	0
The number of disjoint pairs in families of k-element subsets	0
A Chvátal-Erdős type theorem for path-connectivity	0
Extremal graphs for even linear forests in bipartite graphs	0
The matching extendability of optimal 1-embedded graphs on the projective plane	0
On the restricted arc-connectivity of oriented graphs	0
Rainbow disjoint union of clique and matching in edge-colored complete graph	0
The probabilistic upper bounds on the isolation number of a graph	0
Poison Game for semikernels of arbitrary digraphs	0
On proper 2-labellings distinguishing by sums, multisets or products	0
Lower boundary independent and hearing independent broadcasts in graphs	0
Hypergraph operations preserving sc-greediness	0
On the edge-sum distinguishing game	0
Spanning trails avoiding and containing given edges	0
The tree-achieving set and non-separating independent set problem of subcubic graphs	0
On the Strong Path Partition Conjecture	0
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs	0
Vertex partitions of (C4, C5, C10)-free graphs	0
On total domination subdivision numbers of trees	0
New results on Type 2 snarks	0
Lower boundary independent broadcasts in trees	0
On a graph labelling conjecture involving coloured labels	0
Lower general position sets in graphs	0
Maximising 1’s through proper labellings	0
The maximum number of edges in a {Kr+1,Mk+1}-free graph	0
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs	0
Bounds on the global double Roman domination number in graphs	0
Star-critical Ramsey numbers and regular Ramsey numbers for stars	0
An improved bound on the chromatic number of the Pancake graphs	0
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$	0
Equitable choosability of prism graphs	0
Well-covered token graphs	0
Bounds on the total double Roman domination number of graphs	0
Total and paired domination stability in prisms	0
Edge precoloring extension of trees II	0
Dissociation in circulant graphs and integer distance graphs	0
$L(p,q)$-labeling of graphs with interval representations	0
On the broadcast independence number of locally uniform 2-lobsters	0
Complementary coalition graphs: characterization and algorithm	0
Independent [k]-Roman domination on graphs	0
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs	0
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems	0
Contractible subgraphs of quasi 5-connected graphs	0
On polynomial representations of dual DP color functions	0
Number of cliques of Paley-type graphs over finite commutative local rings	0
Majority dominator colorings of graphs	0
The decycling number of a graph with large girth embedded in a surface	0
The linear arboricity of graphs with low treewidth	0
Walecki tournaments with an arc that lies in a unique directed triangle	0
Relationship among B1-EPG, VPT and EPT graphs classes	0
Extremal graphs and classification of planar graphs by MC-numbers	0
Coalition graphs of paths, cycles, and trees	0
Chorded k-pancyclic and weakly k-pancyclic graphs	0
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs	0
Choosability with separation of cycles and outerplanar graphs	0
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs	0
New bounds on domination and independence in graphs	0

Erratum to ``The thickness of amalgamations and Cartesian product of graphs" [Discuss. Math. Graph Theory 37(2017) 561–572]	0
Non-path results on the connectivity keeping problem	0
On a 3-coloring of plane graphs without monochromatic facial 3-paths	0
Edge degree conditions for dominating and spanning closed trails	0
Ramsey and Gallai-Ramsey numbers for forests	0
Spanning trees with a bounded number of branch vertices in a K1,4-free graph	0
Strong and weak Perfect Digraph Theorems for perfect, \alpha-perfect and strictly perfect digraphs	0
On walk domination: weakly toll domination, l2 and l3 domination	0
Online size Ramsey number for C4 and P6	0
Determining number and cost of generalized Mycielskian graphs	0
Equitable cluster partition of graphs with small maximum average degree	0
On \mathcal P vertex-connections of graphs	0
Outer connected domination in maximal outerplanar graphs and beyond	0
On the vertex position number of graphs	0
On link-irregular graphs	0
Minimizing the number of complete bipartite graphs in a Ks-saturated graph	0
2-nearly Platonic graphs	0
3-neighbor bootstrap percolation on grids	0
A note on minimum degree, bipartite holes, and Hamiltonian properties	0
Global dominated coloring of graphs	0
On two conjectures regarding the neighbor-locating chromatic number	0
The directed uniform Hamilton-Waterloo Problem involving even cycle sizes	0
A study of a combination of distance domination and resolvability in graphs	0
On independent coalition in graphs and independent coalition graphs	0
On the total domination number of total graphs	0
The Turán number of three disjoint paths	0
On P5-free locally split graphs	0
Edge intersection hypergraphs	0
On a problem of L. Alcón concerning path domination	0
Retraction Note	0
Double Roman and double Italian domination	0
On subgraphs with prescribed eccentricities	0
Critical aspects in broadcast domination	0
Degree sum condition for vertex-disjoint 5-cycles	0
Edge coloring of products of signed graphs	0
Bipartite Ramsey number pairs involving cycles	0
All tight descriptions of faces in plane triangulations with minimum degree 4	0
Biregular (and regular) planar cages	0
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products	0
The Strong Path Partition Conjecture holds for a = 9	0
Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans	0
An analogue of quasi-transitivity for edge-coloured graphs	0
Edge-maximal graphs with cutwidth at most three	0
Semitotal domination in claw-free graphs	0
Beta invariant and chromatic uniqueness of wheels	0
Sufficient conditions for spanning trees with constrained leaf distance in a graph	0