Articles
7-12
On domination in graphs
13-28
Graphs with large double domination numbers
29-34
On double domination in graphs
35-44
Total domination in categorical products of graphs
45-50
Planar Ramsey numbers
51-56
Domination numbers in graphs with removed edge or set of edges
57-65
Multicolor Ramsey numbers for paths and cycles
67-77
Maximal hypergraphs with respect to the bounded cost hereditary property
79-84
Note on the split domination number of the Cartesian product of paths
85-94
Dominating bipartite subgraphs in graphs
95-102
Combinatorial lemmas for polyhedrons
103-119
On (k,l)-kernel perfectness of special classes of digraphs
121-128
Graph domination in distance two
129-139
The cycle-complete graph Ramsey number r(C₅,K₇)
141-149
Two variants of the size Ramsey number
151-166
Distance coloring of the hexagonal lattice
167-182
Arithmetically maximal independent sets in infinite graphs
183-196
Median and quasi-median direct products of graphs
197-210
Some crossing numbers of products of cycles
211-215
Note on partitions of planar graphs
217-218
Estimation of cut-vertices in edge-coloured complete graphs
219