Sommaire

Preface
p. 205
Hajós' theorem for list colorings of hypergraphs
p. 207
Arboreal structure and regular graphs of median-like classes
p. 215
Tree-like isometric subgraphs of hypercubes
p. 227
Circuit bases of strongly connected digraphs
p. 241
Improving some bounds for dominating Cartesian products
p. 261
Weak k-reconstruction of Cartesian products
p. 273
On constant-weight TSP-tours
p. 287
Modular and median signpost systems and their underlying graphs
p. 309
On maximal finite antichains in the homomorphism order of directed graphs
p. 325
On a special case of Hadwiger's conjecture
p. 333
On dually compact closed classes of graphs and BFS-constructible graphs
p. 365
Undirected and directed graphs with near polynomial growth
p. 383