Articles
185-199
On the (2,2)-domination number of trees
201-222
Radio number for some thorn graphs
223-235
On locating-domination in graphs
237-244
On choosability of complete multipartite graphs
245-256
Chvátal-Erdös type theorems
249-259
Graph centers used for stabilization of matrix factorizations
257-263
Nordhaus-Gaddum results for weakly convex domination number of a graph
265-274
k-independence stable graphs upon edge removal
275-276
17th workshop '3in1' 2008
277-288
Random procedures for dominating sets in bipartite graphs
289-314
On a family of cubic graphs containing the flower snarks
315-333
Mácajová and Škoviera conjecture on cubic graphs
335-347