DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2017-2018): c. 84%

Discussiones Mathematicae Graph Theory

Discussiones Mathematicae Graph Theory 40 (1) (2020)


1

A.Tamil Elakkiya, A. Muthusamy

Gregarious kite factorization of tensor product of complete graphs

PDF7
2

K. Wang, W. Ning , M. Lu

Bounds on the locating-total domination number in trees

PDF25
3

W.Z. Liu, P.P. Li

Decompositions of cubic traceable graphs

PDF35
4

X. Li, Y. Zhang, X. Zhu, Y. Mao, H. Zhao, S. Jendrol'

Conflict-free vertex-connections of graphs

PDF51
5

T. Vetrik

On the metric dimension of directed and undirected circulant graphs

PDF67
6

L. Tang, E. Vumar

A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs

PDF77
7

T. Tian, L. Xiong

2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices

PDF85
8

V. Coll, J. Hook, C. Magnant, K. McCready, K. Ryan

The proper diameter of a graph

PDF107
9

O. Hudry, A. Lobstein

The compared costs of domination, location-domination and identification

PDF127
10

Z.R. Bogdanowicz

On the minimum number of spanning trees in cubic multigraphs

PDF149
11

W. Liu, M. Liu, P. Zhang, L. Feng

Spectral conditions for graphs to be $k$-Hamiltonian or $k$-path-coverable

PDF161
12

Ashraf, S.C. López , F.A. Muntaner-Batle, A. Oshima, M. Bača, A. Semaničová-Feňovčiková

On total $H$-irregularity strength of the disjoint union of graphs

PDF181
13

X. Li, L.G. Wang

Deficiency and forbidden subgraphs of connected , locally-connected graphs

PDF195
14

D. Amos, J. Asplund, B. Brimkov, R. Davila

The Slater and sub-$k$-domination number of a graph with applications to domination and $k$-domination

PDF209
15

Y. Zhao

More on the minimum size of graphs with given rainbow index

PDF227
16

X. Zhao, C.-Q. Xu

Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles

PDF243
17

A. Moradi, D.A. Mojdeh, O. Sharifi

Roman $\{2\}$-bondage number of a graph

PDF255
18

I. Fabrici, J. Harant, S. Mohr, J.M. Schmidt

Longer cycles in essentially 4-connected planar graphs

PDF269
19

M. Sonntag, H.-M. Teichert

Niche hypergraphs of products of digraphs

PDF279
20

W.-H. Lu, C. Yang, H. Ren

Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs

PDF297
21

P. Manuel, S. Klavžar, A. Xavier, A. Arockiaraj, E. Thomas

Strong geodetic problems in networks

PDF307
22

B. Vučković

An improved upper bound on neighbor expanded sum distinguishing index

PDF323
23

W.-Y. Song, L.-Y. Miao, Y.-Y. Duan

Neighbor sum distinguishing total choosability of IC-planar graphs

PDF331
24

F. Kardoš, M. Maceková, M. Mockovčiaková, É. Sopena, R. Soták

Incidence coloring-cold cases

PDF345
25

M. Fürst, D. Rautenbach

A short proof for a lower bound on the zero forcing number

PDF355