Geodesic

Tome 26 (2006) no. 1

Sommaire

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