Discussiones Mathematicae Graph Theory 41 (4) (2021)
1 | C. Balbuena, C. Dalfó and B. Martínez-Barona Sufficient conditions for a digraph to admit a $(1,\leq\ell)$-identifying code | 853 | |
2 | M. Shahsavaran and M.R. Darafsheh | 873 | |
3 | Q. Guo and W. Meng | 893 | |
4 | P. Chen, J. Liang and Y. Peng The Lagrangian density of $\{123,234,456\}$ and the Turán number of its extension | 905 | |
5 | D. Offner and K. Ojakian | 923 | |
6 | M. Naeem, M.K. Siddiqui, M. Bača, A. Semaničová-Feňovčíková and F. Ashraf | 949 | |
7 | P. Adams, S.I. El-Zanati, U. Odabaşi and W. Wannasit The spectrum problem for the connected cubic graphs of order 10 | 963 | |
8 | A.J. Dong and T. Li Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten | 981 | |
9 | N. Gastineau and O. Togni Coloring of the $d^{\text{th}}$ power of the face-centered cubic grid | 1001 | |
10 | S. Cichacz, A. Görlich and Zs. Tuza | 1021 | |
11 | P. Kovář, M. Kravčenko, A. Silber and M. Krbeček | 1041 | |
12 | S. Nakamura | 1051 | |
13 | X.-G. Chen, Y.-F. Wang and X.-F. Wu Hereditary equality of domination and exponential domination in subcubic graphs | 1067 | |
14 | P. Manuel | 1077 | |
15 | J.A. Mudrock, M. Chase, E. Thornburgh, I. Kadera and T. Wagstrom A note on the equitable choosability of complete bipartite graphs | 1091 | |
16 | N. Matsumoto and Y. Suzuki | 1103 | |
17 | R. Jajcay and T. Raiman | 1115 | |
18 | N. Polat | 1127 | |
19 | H. Furmańczyk and R. Zuazua | 1147 | |
20 | A. Tepeh Total domination in generalized prisms and a new domination invariant | 1165 | |
21 | J. Pavan Kumar and P.V.S. Reddy Algorithmic aspects of secure connected domination in graphs | 1179 | |
22 | M. Ghorbani, H.R. Maimani, M. Momeni, F. Rahimi Mahid, S. Klavžar and G. Rus The general position problem on Kneser graphs and on some graph operations | 1199 | |
23 | J.A. Mudrock, M. Marsh and T. Wagstrom On list equitable total colorings of the generalized theta graph | 1215 |