Sommaire

Motion planning in cartesian product graphs
p. 207
The ramsey number for theta graph versus a clique of order three and four
p. 223
The depression of a graph and k-kernels
p. 233
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
p. 249
The irregularity of graphs under graph operations
p. 263
On the uniqueness of d-vertex magic constant
p. 279
Heavy subgraph pairs for traceability of block-chains
p. 287
Rank numbers for bent ladders
p. 309
A decomposition of gallai multigraphs
p. 331
The niche graphs of interval orders
p. 353
Families of triples with high minimum degree are hamiltonian
p. 361
On degree sets and the minimum orders in bipartite graphs
p. 383
On eulerian irregularity in graphs
p. 391
A note on pm-compact bipartite graphs
p. 409
Maximal buttonings of trees
p. 415
A note on face coloring entire weightings of plane graphs
p. 421