DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2019: 0.755

SCImago Journal Rank (SJR) 2019: 0.600

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

Discussiones Mathematicae Graph Theory

Discussiones Mathematicae Graph Theory 41 (2) (2021)


1

H. Abdollahzadeh Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam and S.M. Sheikholeslami

Total 2-rainbow domination numbers of trees

PDF345
2

V. Samodivkin

Changing and unchanging of the domination number of a graph: path addition numbers

PDF365
3

C.J. Jayawardene, D. Narváez and S.P. Radziszowski

Star-critical Ramsey numbers for cycles versus $K_4$

PDF381
4

J.M. Campero-Alonzo and R. Sánchez-López

$H$-kernels in unions of $H$-colored quasi-transitive digraphs

PDF391
5

Y. Sun, B. Sheng and Z. Jin

The minimum size of a graph with given tree connectivity

PDF409
6

E. Zhu and Z. Shao

On the star chromatic index of generalized Petersen graphs

PDF427
7

R. Janczewski, A.M. Trzaskowska and K. Turowski

$T$-colorings, divisibility and the circular chromatic number

PDF441
8

T.-W. Shyu

Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each

PDF451
9

H. Jiang, W. Li, X. Li and C. Magnant

On proper (strong) rainbow connection of graphs

PDF469
10

C. Lewchalermvongs and N. Ananchuen

Internally 4-connected graphs with no $\{$cube, $V_8 \}$-minor

PDF481
11

E. Máčajová and M. Škoviera

Critical and flow-critical snarks coincide

PDF503
12

H. Li, Y. Ma and X. Li

The vertex-rainbow connection number of some graph operations

PDF513
13

B. Niu and X. Zhang

On $(p,1)$-total labelling of some 1-planar graphs

PDF531
14

J. Wu, H. Broersma, Y. Mao and Q. Ma

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph

PDF559
15

N. Zubrilina

Asymptotic behavior of the edge metric dimension of the random graph

PDF589
16

A. Das

Triameter of graphs

PDF601
17

T. Duy Doan and I. Schiermeyer

Conflict-free vertex connection number at most 3 and size of graphs

PDF617
18

W.J. Desormeaux, T.W. Haynes and M.A. Henning

Restrained domination in self-complementary graphs

PDF633
19

M. Hajian and N. Jafari Rad

Fair total domination number in cactus graphs

PDF647
20

C.M. Mynhardt and J. Raczek

Block graphs with large paired domination multisubdivision number

PDF665
21

R. Wang

Hamilton cycle problem in strong $k$-quasi-transitive digraphs with large diameter

PDF685