Discussiones Mathematicae Graph Theory 40 (1) (2020)
| 1 | A.Tamil Elakkiya and A. Muthusamy Gregarious kite factorization of tensor product of complete graphs | PDF | 7 |
| 2 | K. Wang, W. Ning and M. Lu Bounds on the locating-total domination number in trees | PDF | 25 |
| 3 | W.Z. Liu and P.P. Li Decompositions of cubic traceable graphs | PDF | 35 |
| 4 | X. Li, Y. Zhang, X. Zhu, Y. Mao, H. Zhao and S. Jendrol' Conflict-free vertex-connections of graphs | PDF | 51 |
| 5 | T. Vetrik On the metric dimension of directed and undirected circulant graphs | PDF | 67 |
| 6 | L. Tang and E. Vumar A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs | PDF | 77 |
| 7 | T. Tian and L. Xiong 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices | PDF | 85 |
| 8 | V. Coll, J. Hook, C. Magnant, K. McCready and K. Ryan The proper diameter of a graph | PDF | 107 |
| 9 | O. Hudry and A. Lobstein The compared costs of domination, location-domination and identification | PDF | 127 |
| 10 | Z.R. Bogdanowicz On the minimum number of spanning trees in cubic multigraphs | PDF | 149 |
| 11 | W. Liu, M. Liu, P. Zhang and L. Feng Spectral conditions for graphs to be $k$-Hamiltonian or $k$-path-coverable | PDF | 161 |
| 12 | Ashraf, S.C. López , F.A. Muntaner-Batle, A. Oshima, M. Bača and A. Semaničová-Feňovčiková On total $H$-irregularity strength of the disjoint union of graphs | PDF | 181 |
| 13 | X. Li and L.G. Wang Deficiency and forbidden subgraphs of connected , locally-connected graphs | PDF | 195 |
| 14 | D. Amos, J. Asplund, B. Brimkov and R. Davila The Slater and sub-$k$-domination number of a graph with applications to domination and $k$-domination | PDF | 209 |
| 15 | Y. Zhao More on the minimum size of graphs with given rainbow index | PDF | 227 |
| 16 | X. Zhao and C.-Q. Xu Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles | PDF | 243 |
| 17 | A. Moradi, D.A. Mojdeh and O. Sharifi Roman $\{2\}$-bondage number of a graph | PDF | 255 |
| 18 | I. Fabrici, J. Harant, S. Mohr and J.M. Schmidt Longer cycles in essentially 4-connected planar graphs | PDF | 269 |
| 19 | M. Sonntag and H.-M. Teichert Niche hypergraphs of products of digraphs | PDF | 279 |
| 20 | W.-H. Lu, C. Yang and H. Ren Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs | PDF | 297 |
| 21 | P. Manuel, S. Klavžar, A. Xavier, A. Arockiaraj and E. Thomas Strong geodetic problems in networks | PDF | 307 |
| 22 | B. Vučković An improved upper bound on neighbor expanded sum distinguishing index | PDF | 323 |
| 23 | W.-Y. Song, L.-Y. Miao and Y.-Y. Duan Neighbor sum distinguishing total choosability of IC-planar graphs | PDF | 331 |
| 24 | F. Kardoš, M. Maceková, M. Mockovčiaková, É. Sopena and R. Soták Incidence coloring-cold cases | PDF | 345 |
| 25 | M. Fürst and D. Rautenbach A short proof for a lower bound on the zero forcing number | PDF | 355 |