Sommaire

Algorithmic aspects of total-subdomination in graphs
p. 5
An anti-Ramsey theorem on edge-cuts
p. 19
Extension of several sufficient conditions for Hamiltonian graphs
p. 23
A characterization of planar median graphs
p. 41
Spectral integral variation of trees
p. 49
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
p. 59
Chvátal's Condition cannot hold for both a graph and its complement
p. 73
Leaps: an approach to the block structure of a graph
p. 77
The use of Euler's formula in (3,1)*-list coloring
p. 91
Some results on total domination in direct products of graphs
p. 103
On the basis number and the minimum cycle bases of the wreath product of some graphs i
p. 113
A prime factor theorem for a generalized direct product
p. 135
Decomposing complete graphs into cubes
p. 141
Optimal edge ranking of complete bipartite graphs in polynomial time
p. 149
Wiener index of generalized stars and their quadratic line graphs
p. 161