Discussiones Mathematicae Graph Theory 37 (1) (2017)
| 1 | O.V. Borodin, A.O. Ivanova All tight descriptions of 3-stars in 3-polytopes with girth 5 | PDF | 5 |
| 2 | Y. Metelsky, K. Schemeleva, F. Werner A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs | PDF | 13 |
| 3 | E. Flandrin, H. Li, A. Marczyk, J.F. Saclé, M. Woźniak A note on neighbor expanded sum distinguishing index | PDF | 29 |
| 4 | L. Asgharsharghi, S.M. Sheikholeslami, L. Volkmann Signed Roman edge $k$-domination in graphs | PDF | 39 |
| 5 | D. Froncek Decomposition of certain complete bipartite graphs into prisms | PDF | 55 |
| 6 | W.F. Klostermeyer, G. MacGillivray Eternal domination: criticality and reachability | PDF | 63 |
| 7 | E. Hexel On the $H$-force number of Hamiltonian graphs and cycle extendability | PDF | 79 |
| 8 | O. Baudon, J. Bensmail, F. Foucaud, M. Pilśniak Structural properties of recursively partitionable graphs with connectivity 2 | PDF | 89 |
| 9 | P. R. Garcia-Vázquez, C. Hernández-Cruz Some results on 4-transitive digraphs | PDF | 117 |
| 10 | B.Y. Bam, C. M. Deshpande, L. N. Kamble Almost self-complementary 3-uniform hypergraphs | PDF | 131 |
| 11 | X. Li, H. Li , Y. Sun Rainbow connection number of graphs with diameter 3 | PDF | 141 |
| 12 | E. Estaji, W. Imrich, R. Kalinowski, M. Pilśniak, T. Tucker Distinguishing Cartesian products of countable graphs | PDF | 155 |
| 13 | P. Immel, P.S. Wenger The list distinguishing number equals the distinguishing number for interval graphs | PDF | 165 |
| 14 | H. Belkhechine, P. Ille, R.E. Woodrow Criticality of switching classes of reversible 2-structures labeled by an Abelian group | PDF | 175 |
| 15 | J. Bensmail On $q$-power cycles in cubic graphs | PDF | 211 |
| 16 | N. Javier, B. Llano The dichromatic number of infinite families of circulant tournaments | PDF | 221 |
| 17 | S. Cichacz, M. Nikodem Union of distance magic graphs | PDF | 239 |
| 18 | J.-Y. Guo, J.-H. Yin A constructive extension of the characterization on potentially $K_{s,t}$-bigraphic pairs | PDF | 251 |
| 19 | L. Volkmann Signed total Roman domination in digraphs | PDF | 261 |
| 20 | D. Kuziak, J.A. Rodríguez-Velázquez, I.G. Yero Computing the metric dimension of a graph from primary subgraphs | PDF | 273 |
Ensuring a high language level of DMGT - the task financed under the contract 804/P-DUN/2017 from the funds of the Minister of Science and Higher Education for the dissemination of science.